./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem11_label19_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem11_label19_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash afc12bc69e705b75a7b12a06ad7a3fcc3e70b0b1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 22:29:06,700 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 22:29:06,703 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 22:29:06,721 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 22:29:06,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 22:29:06,725 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 22:29:06,727 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 22:29:06,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 22:29:06,732 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 22:29:06,734 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 22:29:06,735 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 22:29:06,735 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 22:29:06,739 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 22:29:06,740 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 22:29:06,741 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 22:29:06,745 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 22:29:06,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 22:29:06,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 22:29:06,762 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 22:29:06,764 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 22:29:06,767 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 22:29:06,768 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 22:29:06,773 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 22:29:06,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 22:29:06,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 22:29:06,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 22:29:06,778 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 22:29:06,781 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 22:29:06,782 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 22:29:06,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 22:29:06,788 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 22:29:06,789 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 22:29:06,790 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 22:29:06,790 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 22:29:06,791 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 22:29:06,792 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 22:29:06,792 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 22:29:06,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 22:29:06,831 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 22:29:06,832 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 22:29:06,833 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 22:29:06,833 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 22:29:06,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 22:29:06,833 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 22:29:06,834 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 22:29:06,834 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 22:29:06,834 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 22:29:06,834 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 22:29:06,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 22:29:06,835 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 22:29:06,836 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 22:29:06,836 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 22:29:06,836 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 22:29:06,836 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 22:29:06,837 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 22:29:06,837 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 22:29:06,837 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 22:29:06,837 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 22:29:06,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 22:29:06,837 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 22:29:06,838 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 22:29:06,843 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 22:29:06,843 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 22:29:06,844 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 22:29:06,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 22:29:06,844 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> afc12bc69e705b75a7b12a06ad7a3fcc3e70b0b1 [2018-12-30 22:29:06,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 22:29:06,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 22:29:06,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 22:29:06,950 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 22:29:06,951 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 22:29:06,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem11_label19_true-unreach-call.c [2018-12-30 22:29:07,019 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbcb33980/d017fb899ca5499c93ef9e2879b4f536/FLAG96adbbac0 [2018-12-30 22:29:07,630 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 22:29:07,631 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem11_label19_true-unreach-call.c [2018-12-30 22:29:07,662 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbcb33980/d017fb899ca5499c93ef9e2879b4f536/FLAG96adbbac0 [2018-12-30 22:29:07,831 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbcb33980/d017fb899ca5499c93ef9e2879b4f536 [2018-12-30 22:29:07,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 22:29:07,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 22:29:07,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 22:29:07,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 22:29:07,848 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 22:29:07,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 10:29:07" (1/1) ... [2018-12-30 22:29:07,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba04cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:29:07, skipping insertion in model container [2018-12-30 22:29:07,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 10:29:07" (1/1) ... [2018-12-30 22:29:07,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 22:29:07,957 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 22:29:08,523 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 22:29:08,536 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 22:29:08,735 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 22:29:08,760 INFO L195 MainTranslator]: Completed translation [2018-12-30 22:29:08,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:29:08 WrapperNode [2018-12-30 22:29:08,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 22:29:08,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 22:29:08,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 22:29:08,764 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 22:29:08,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:29:08" (1/1) ... [2018-12-30 22:29:08,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:29:08" (1/1) ... [2018-12-30 22:29:09,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 22:29:09,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 22:29:09,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 22:29:09,055 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 22:29:09,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:29:08" (1/1) ... [2018-12-30 22:29:09,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:29:08" (1/1) ... [2018-12-30 22:29:09,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:29:08" (1/1) ... [2018-12-30 22:29:09,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:29:08" (1/1) ... [2018-12-30 22:29:09,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:29:08" (1/1) ... [2018-12-30 22:29:09,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:29:08" (1/1) ... [2018-12-30 22:29:09,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:29:08" (1/1) ... [2018-12-30 22:29:09,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 22:29:09,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 22:29:09,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 22:29:09,183 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 22:29:09,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:29:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 22:29:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 22:29:09,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 22:29:13,795 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 22:29:13,795 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 22:29:13,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 10:29:13 BoogieIcfgContainer [2018-12-30 22:29:13,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 22:29:13,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 22:29:13,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 22:29:13,802 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 22:29:13,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 10:29:07" (1/3) ... [2018-12-30 22:29:13,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdf8eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 10:29:13, skipping insertion in model container [2018-12-30 22:29:13,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:29:08" (2/3) ... [2018-12-30 22:29:13,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdf8eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 10:29:13, skipping insertion in model container [2018-12-30 22:29:13,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 10:29:13" (3/3) ... [2018-12-30 22:29:13,807 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label19_true-unreach-call.c [2018-12-30 22:29:13,820 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 22:29:13,831 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 22:29:13,852 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 22:29:13,897 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 22:29:13,898 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 22:29:13,899 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 22:29:13,899 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 22:29:13,899 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 22:29:13,899 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 22:29:13,899 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 22:29:13,899 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 22:29:13,901 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 22:29:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2018-12-30 22:29:13,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-30 22:29:13,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:29:13,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:29:13,957 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:29:13,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:29:13,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2158734, now seen corresponding path program 1 times [2018-12-30 22:29:13,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:29:13,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:29:14,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:14,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:29:14,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:29:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:29:14,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:29:14,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 22:29:14,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:29:14,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:29:14,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:29:14,477 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2018-12-30 22:29:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:29:18,564 INFO L93 Difference]: Finished difference Result 960 states and 1739 transitions. [2018-12-30 22:29:18,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:29:18,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-30 22:29:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:29:18,590 INFO L225 Difference]: With dead ends: 960 [2018-12-30 22:29:18,590 INFO L226 Difference]: Without dead ends: 610 [2018-12-30 22:29:18,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:29:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-12-30 22:29:18,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 595. [2018-12-30 22:29:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-12-30 22:29:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 904 transitions. [2018-12-30 22:29:18,710 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 904 transitions. Word has length 56 [2018-12-30 22:29:18,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:29:18,711 INFO L480 AbstractCegarLoop]: Abstraction has 595 states and 904 transitions. [2018-12-30 22:29:18,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:29:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 904 transitions. [2018-12-30 22:29:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-30 22:29:18,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:29:18,718 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:29:18,719 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:29:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:29:18,719 INFO L82 PathProgramCache]: Analyzing trace with hash 217134498, now seen corresponding path program 1 times [2018-12-30 22:29:18,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:29:18,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:29:18,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:18,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:29:18,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:29:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:29:19,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:29:19,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 22:29:19,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 22:29:19,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 22:29:19,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-30 22:29:19,601 INFO L87 Difference]: Start difference. First operand 595 states and 904 transitions. Second operand 7 states. [2018-12-30 22:29:19,780 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-12-30 22:29:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:29:23,684 INFO L93 Difference]: Finished difference Result 1929 states and 2898 transitions. [2018-12-30 22:29:23,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:29:23,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2018-12-30 22:29:23,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:29:23,699 INFO L225 Difference]: With dead ends: 1929 [2018-12-30 22:29:23,699 INFO L226 Difference]: Without dead ends: 1336 [2018-12-30 22:29:23,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-30 22:29:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2018-12-30 22:29:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1334. [2018-12-30 22:29:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2018-12-30 22:29:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1721 transitions. [2018-12-30 22:29:23,763 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1721 transitions. Word has length 129 [2018-12-30 22:29:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:29:23,764 INFO L480 AbstractCegarLoop]: Abstraction has 1334 states and 1721 transitions. [2018-12-30 22:29:23,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 22:29:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1721 transitions. [2018-12-30 22:29:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-30 22:29:23,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:29:23,778 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:29:23,778 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:29:23,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:29:23,780 INFO L82 PathProgramCache]: Analyzing trace with hash 814485289, now seen corresponding path program 1 times [2018-12-30 22:29:23,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:29:23,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:29:23,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:23,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:29:23,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:29:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-30 22:29:24,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:29:24,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:29:24,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:29:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:29:24,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:29:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-30 22:29:24,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 22:29:24,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-12-30 22:29:24,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:29:24,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:29:24,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:29:24,459 INFO L87 Difference]: Start difference. First operand 1334 states and 1721 transitions. Second operand 4 states. [2018-12-30 22:29:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:29:28,660 INFO L93 Difference]: Finished difference Result 3964 states and 5397 transitions. [2018-12-30 22:29:28,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:29:28,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-12-30 22:29:28,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:29:28,678 INFO L225 Difference]: With dead ends: 3964 [2018-12-30 22:29:28,678 INFO L226 Difference]: Without dead ends: 2816 [2018-12-30 22:29:28,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:29:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2018-12-30 22:29:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2448. [2018-12-30 22:29:28,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2448 states. [2018-12-30 22:29:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 3005 transitions. [2018-12-30 22:29:28,743 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 3005 transitions. Word has length 199 [2018-12-30 22:29:28,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:29:28,744 INFO L480 AbstractCegarLoop]: Abstraction has 2448 states and 3005 transitions. [2018-12-30 22:29:28,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:29:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 3005 transitions. [2018-12-30 22:29:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-30 22:29:28,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:29:28,750 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:29:28,750 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:29:28,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:29:28,751 INFO L82 PathProgramCache]: Analyzing trace with hash -814689872, now seen corresponding path program 1 times [2018-12-30 22:29:28,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:29:28,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:29:28,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:28,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:29:28,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:29:29,229 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-12-30 22:29:29,527 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-12-30 22:29:29,797 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-12-30 22:29:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 107 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:29:29,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:29:29,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:29:29,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:29:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:29:30,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:29:30,617 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 29 [2018-12-30 22:29:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 79 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:29:30,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:29:30,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-12-30 22:29:30,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-30 22:29:30,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-30 22:29:30,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-30 22:29:30,981 INFO L87 Difference]: Start difference. First operand 2448 states and 3005 transitions. Second operand 11 states. [2018-12-30 22:29:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:29:46,076 INFO L93 Difference]: Finished difference Result 18372 states and 23549 transitions. [2018-12-30 22:29:46,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-30 22:29:46,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 237 [2018-12-30 22:29:46,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:29:46,144 INFO L225 Difference]: With dead ends: 18372 [2018-12-30 22:29:46,145 INFO L226 Difference]: Without dead ends: 16110 [2018-12-30 22:29:46,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=346, Invalid=986, Unknown=0, NotChecked=0, Total=1332 [2018-12-30 22:29:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16110 states. [2018-12-30 22:29:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16110 to 9072. [2018-12-30 22:29:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9072 states. [2018-12-30 22:29:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9072 states to 9072 states and 10725 transitions. [2018-12-30 22:29:46,405 INFO L78 Accepts]: Start accepts. Automaton has 9072 states and 10725 transitions. Word has length 237 [2018-12-30 22:29:46,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:29:46,406 INFO L480 AbstractCegarLoop]: Abstraction has 9072 states and 10725 transitions. [2018-12-30 22:29:46,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-30 22:29:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 9072 states and 10725 transitions. [2018-12-30 22:29:46,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-30 22:29:46,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:29:46,415 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:29:46,415 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:29:46,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:29:46,415 INFO L82 PathProgramCache]: Analyzing trace with hash -70460415, now seen corresponding path program 1 times [2018-12-30 22:29:46,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:29:46,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:29:46,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:46,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:29:46,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:29:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:29:46,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:29:46,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:29:46,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 22:29:46,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 22:29:46,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:29:46,962 INFO L87 Difference]: Start difference. First operand 9072 states and 10725 transitions. Second operand 5 states. [2018-12-30 22:29:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:29:50,484 INFO L93 Difference]: Finished difference Result 25151 states and 30096 transitions. [2018-12-30 22:29:50,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 22:29:50,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 248 [2018-12-30 22:29:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:29:50,536 INFO L225 Difference]: With dead ends: 25151 [2018-12-30 22:29:50,536 INFO L226 Difference]: Without dead ends: 16265 [2018-12-30 22:29:50,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:29:50,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16265 states. [2018-12-30 22:29:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16265 to 12020. [2018-12-30 22:29:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12020 states. [2018-12-30 22:29:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 14136 transitions. [2018-12-30 22:29:50,783 INFO L78 Accepts]: Start accepts. Automaton has 12020 states and 14136 transitions. Word has length 248 [2018-12-30 22:29:50,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:29:50,784 INFO L480 AbstractCegarLoop]: Abstraction has 12020 states and 14136 transitions. [2018-12-30 22:29:50,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 22:29:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 12020 states and 14136 transitions. [2018-12-30 22:29:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-12-30 22:29:50,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:29:50,798 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:29:50,798 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:29:50,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:29:50,798 INFO L82 PathProgramCache]: Analyzing trace with hash 92387790, now seen corresponding path program 1 times [2018-12-30 22:29:50,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:29:50,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:29:50,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:50,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:29:50,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:29:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-30 22:29:51,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:29:51,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:29:51,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:29:51,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:29:51,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:29:51,118 INFO L87 Difference]: Start difference. First operand 12020 states and 14136 transitions. Second operand 4 states. [2018-12-30 22:29:52,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:29:52,839 INFO L93 Difference]: Finished difference Result 25892 states and 30802 transitions. [2018-12-30 22:29:52,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:29:52,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2018-12-30 22:29:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:29:52,882 INFO L225 Difference]: With dead ends: 25892 [2018-12-30 22:29:52,883 INFO L226 Difference]: Without dead ends: 14058 [2018-12-30 22:29:52,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:29:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14058 states. [2018-12-30 22:29:53,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14058 to 13492. [2018-12-30 22:29:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13492 states. [2018-12-30 22:29:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13492 states to 13492 states and 15866 transitions. [2018-12-30 22:29:53,096 INFO L78 Accepts]: Start accepts. Automaton has 13492 states and 15866 transitions. Word has length 326 [2018-12-30 22:29:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:29:53,097 INFO L480 AbstractCegarLoop]: Abstraction has 13492 states and 15866 transitions. [2018-12-30 22:29:53,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:29:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 13492 states and 15866 transitions. [2018-12-30 22:29:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-12-30 22:29:53,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:29:53,110 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:29:53,111 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:29:53,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:29:53,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2086914279, now seen corresponding path program 1 times [2018-12-30 22:29:53,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:29:53,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:29:53,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:53,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:29:53,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:29:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-12-30 22:29:53,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:29:53,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 22:29:53,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 22:29:53,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 22:29:53,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:29:53,433 INFO L87 Difference]: Start difference. First operand 13492 states and 15866 transitions. Second operand 3 states. [2018-12-30 22:29:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:29:54,587 INFO L93 Difference]: Finished difference Result 25870 states and 30291 transitions. [2018-12-30 22:29:54,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 22:29:54,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2018-12-30 22:29:54,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:29:54,608 INFO L225 Difference]: With dead ends: 25870 [2018-12-30 22:29:54,609 INFO L226 Difference]: Without dead ends: 12564 [2018-12-30 22:29:54,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:29:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12564 states. [2018-12-30 22:29:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12564 to 12563. [2018-12-30 22:29:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12563 states. [2018-12-30 22:29:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12563 states to 12563 states and 14610 transitions. [2018-12-30 22:29:54,800 INFO L78 Accepts]: Start accepts. Automaton has 12563 states and 14610 transitions. Word has length 338 [2018-12-30 22:29:54,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:29:54,803 INFO L480 AbstractCegarLoop]: Abstraction has 12563 states and 14610 transitions. [2018-12-30 22:29:54,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 22:29:54,803 INFO L276 IsEmpty]: Start isEmpty. Operand 12563 states and 14610 transitions. [2018-12-30 22:29:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-12-30 22:29:54,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:29:54,818 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:29:54,818 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:29:54,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:29:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1298512828, now seen corresponding path program 1 times [2018-12-30 22:29:54,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:29:54,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:29:54,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:54,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:29:54,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:29:55,364 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 396 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:29:55,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:29:55,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:29:55,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:29:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:29:55,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:29:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-12-30 22:29:55,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 22:29:55,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-12-30 22:29:55,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 22:29:55,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 22:29:55,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-30 22:29:55,639 INFO L87 Difference]: Start difference. First operand 12563 states and 14610 transitions. Second operand 7 states. [2018-12-30 22:29:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:29:59,285 INFO L93 Difference]: Finished difference Result 29772 states and 35106 transitions. [2018-12-30 22:29:59,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 22:29:59,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 355 [2018-12-30 22:29:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:29:59,309 INFO L225 Difference]: With dead ends: 29772 [2018-12-30 22:29:59,309 INFO L226 Difference]: Without dead ends: 17395 [2018-12-30 22:29:59,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-30 22:29:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17395 states. [2018-12-30 22:29:59,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17395 to 13297. [2018-12-30 22:29:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13297 states. [2018-12-30 22:29:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13297 states to 13297 states and 14973 transitions. [2018-12-30 22:29:59,532 INFO L78 Accepts]: Start accepts. Automaton has 13297 states and 14973 transitions. Word has length 355 [2018-12-30 22:29:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:29:59,533 INFO L480 AbstractCegarLoop]: Abstraction has 13297 states and 14973 transitions. [2018-12-30 22:29:59,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 22:29:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 13297 states and 14973 transitions. [2018-12-30 22:29:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-12-30 22:29:59,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:29:59,544 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:29:59,544 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:29:59,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:29:59,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1462969262, now seen corresponding path program 1 times [2018-12-30 22:29:59,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:29:59,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:29:59,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:59,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:29:59,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:29:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:30:00,153 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 134 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:30:00,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:30:00,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:30:00,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:30:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:30:00,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:30:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-12-30 22:30:00,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 22:30:00,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-12-30 22:30:00,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 22:30:00,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 22:30:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-30 22:30:00,399 INFO L87 Difference]: Start difference. First operand 13297 states and 14973 transitions. Second operand 6 states. [2018-12-30 22:30:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:30:04,062 INFO L93 Difference]: Finished difference Result 27892 states and 31344 transitions. [2018-12-30 22:30:04,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 22:30:04,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 377 [2018-12-30 22:30:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:30:04,083 INFO L225 Difference]: With dead ends: 27892 [2018-12-30 22:30:04,084 INFO L226 Difference]: Without dead ends: 14781 [2018-12-30 22:30:04,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 376 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-30 22:30:04,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14781 states. [2018-12-30 22:30:04,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14781 to 12196. [2018-12-30 22:30:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12196 states. [2018-12-30 22:30:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12196 states to 12196 states and 13589 transitions. [2018-12-30 22:30:04,277 INFO L78 Accepts]: Start accepts. Automaton has 12196 states and 13589 transitions. Word has length 377 [2018-12-30 22:30:04,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:30:04,278 INFO L480 AbstractCegarLoop]: Abstraction has 12196 states and 13589 transitions. [2018-12-30 22:30:04,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 22:30:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand 12196 states and 13589 transitions. [2018-12-30 22:30:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-12-30 22:30:04,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:30:04,293 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:30:04,294 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:30:04,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:30:04,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1735842170, now seen corresponding path program 1 times [2018-12-30 22:30:04,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:30:04,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:30:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:30:04,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:30:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:30:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:30:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 420 proven. 78 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-12-30 22:30:04,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:30:04,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:30:04,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:30:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:30:05,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:30:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 420 proven. 78 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-12-30 22:30:05,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:30:05,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-12-30 22:30:05,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 22:30:05,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 22:30:05,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:30:05,301 INFO L87 Difference]: Start difference. First operand 12196 states and 13589 transitions. Second operand 5 states. [2018-12-30 22:30:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:30:08,950 INFO L93 Difference]: Finished difference Result 26054 states and 28955 transitions. [2018-12-30 22:30:08,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 22:30:08,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 429 [2018-12-30 22:30:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:30:08,967 INFO L225 Difference]: With dead ends: 26054 [2018-12-30 22:30:08,968 INFO L226 Difference]: Without dead ends: 14228 [2018-12-30 22:30:08,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 428 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-30 22:30:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14228 states. [2018-12-30 22:30:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14228 to 12564. [2018-12-30 22:30:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12564 states. [2018-12-30 22:30:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12564 states to 12564 states and 13933 transitions. [2018-12-30 22:30:09,145 INFO L78 Accepts]: Start accepts. Automaton has 12564 states and 13933 transitions. Word has length 429 [2018-12-30 22:30:09,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:30:09,145 INFO L480 AbstractCegarLoop]: Abstraction has 12564 states and 13933 transitions. [2018-12-30 22:30:09,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 22:30:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 12564 states and 13933 transitions. [2018-12-30 22:30:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2018-12-30 22:30:09,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:30:09,166 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:30:09,166 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:30:09,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:30:09,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1592139152, now seen corresponding path program 1 times [2018-12-30 22:30:09,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:30:09,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:30:09,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:30:09,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:30:09,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:30:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:30:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 302 proven. 314 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-12-30 22:30:09,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:30:09,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:30:09,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:30:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:30:10,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:30:10,263 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 17 [2018-12-30 22:30:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 356 proven. 260 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-12-30 22:30:11,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:30:11,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-12-30 22:30:11,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 22:30:11,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 22:30:11,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-30 22:30:11,837 INFO L87 Difference]: Start difference. First operand 12564 states and 13933 transitions. Second operand 9 states. [2018-12-30 22:30:20,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:30:20,279 INFO L93 Difference]: Finished difference Result 30855 states and 34277 transitions. [2018-12-30 22:30:20,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 22:30:20,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 541 [2018-12-30 22:30:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:30:20,300 INFO L225 Difference]: With dead ends: 30855 [2018-12-30 22:30:20,300 INFO L226 Difference]: Without dead ends: 18661 [2018-12-30 22:30:20,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 538 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-30 22:30:20,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18661 states. [2018-12-30 22:30:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18661 to 15332. [2018-12-30 22:30:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15332 states. [2018-12-30 22:30:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15332 states to 15332 states and 16907 transitions. [2018-12-30 22:30:20,552 INFO L78 Accepts]: Start accepts. Automaton has 15332 states and 16907 transitions. Word has length 541 [2018-12-30 22:30:20,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:30:20,553 INFO L480 AbstractCegarLoop]: Abstraction has 15332 states and 16907 transitions. [2018-12-30 22:30:20,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 22:30:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 15332 states and 16907 transitions. [2018-12-30 22:30:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-12-30 22:30:20,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:30:20,575 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:30:20,575 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:30:20,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:30:20,577 INFO L82 PathProgramCache]: Analyzing trace with hash 79502953, now seen corresponding path program 1 times [2018-12-30 22:30:20,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:30:20,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:30:20,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:30:20,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:30:20,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:30:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:30:21,057 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 367 proven. 54 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-12-30 22:30:21,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:30:21,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:30:21,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:30:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:30:21,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:30:21,568 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 29 [2018-12-30 22:30:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 223 proven. 198 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-12-30 22:30:22,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:30:22,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-12-30 22:30:22,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 22:30:22,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 22:30:22,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-30 22:30:22,222 INFO L87 Difference]: Start difference. First operand 15332 states and 16907 transitions. Second operand 9 states. [2018-12-30 22:30:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:30:30,401 INFO L93 Difference]: Finished difference Result 36212 states and 39808 transitions. [2018-12-30 22:30:30,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-30 22:30:30,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 552 [2018-12-30 22:30:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:30:30,424 INFO L225 Difference]: With dead ends: 36212 [2018-12-30 22:30:30,425 INFO L226 Difference]: Without dead ends: 21066 [2018-12-30 22:30:30,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-12-30 22:30:30,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21066 states. [2018-12-30 22:30:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21066 to 13485. [2018-12-30 22:30:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13485 states. [2018-12-30 22:30:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13485 states to 13485 states and 14805 transitions. [2018-12-30 22:30:30,662 INFO L78 Accepts]: Start accepts. Automaton has 13485 states and 14805 transitions. Word has length 552 [2018-12-30 22:30:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:30:30,663 INFO L480 AbstractCegarLoop]: Abstraction has 13485 states and 14805 transitions. [2018-12-30 22:30:30,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 22:30:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand 13485 states and 14805 transitions. [2018-12-30 22:30:30,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2018-12-30 22:30:30,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:30:30,682 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:30:30,682 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:30:30,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:30:30,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1573195711, now seen corresponding path program 1 times [2018-12-30 22:30:30,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:30:30,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:30:30,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:30:30,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:30:30,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:30:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:30:31,363 WARN L181 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-12-30 22:30:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 798 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-12-30 22:30:31,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:30:31,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:30:31,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:30:31,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:30:31,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:30:31,479 INFO L87 Difference]: Start difference. First operand 13485 states and 14805 transitions. Second operand 4 states. [2018-12-30 22:30:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:30:32,961 INFO L93 Difference]: Finished difference Result 27350 states and 30058 transitions. [2018-12-30 22:30:32,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:30:32,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 563 [2018-12-30 22:30:32,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:30:32,975 INFO L225 Difference]: With dead ends: 27350 [2018-12-30 22:30:32,975 INFO L226 Difference]: Without dead ends: 14235 [2018-12-30 22:30:32,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:30:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14235 states. [2018-12-30 22:30:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14235 to 12749. [2018-12-30 22:30:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12749 states. [2018-12-30 22:30:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12749 states to 12749 states and 13916 transitions. [2018-12-30 22:30:33,141 INFO L78 Accepts]: Start accepts. Automaton has 12749 states and 13916 transitions. Word has length 563 [2018-12-30 22:30:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:30:33,142 INFO L480 AbstractCegarLoop]: Abstraction has 12749 states and 13916 transitions. [2018-12-30 22:30:33,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:30:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 12749 states and 13916 transitions. [2018-12-30 22:30:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-12-30 22:30:33,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:30:33,154 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:30:33,154 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:30:33,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:30:33,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2061856616, now seen corresponding path program 1 times [2018-12-30 22:30:33,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:30:33,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:30:33,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:30:33,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:30:33,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:30:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:30:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 660 proven. 237 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-12-30 22:30:33,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:30:33,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:30:33,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:30:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:30:34,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:30:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 660 proven. 237 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-12-30 22:30:34,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:30:34,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-12-30 22:30:34,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 22:30:34,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 22:30:34,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:30:34,291 INFO L87 Difference]: Start difference. First operand 12749 states and 13916 transitions. Second operand 5 states. [2018-12-30 22:30:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:30:36,651 INFO L93 Difference]: Finished difference Result 30651 states and 33309 transitions. [2018-12-30 22:30:36,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 22:30:36,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 612 [2018-12-30 22:30:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:30:36,667 INFO L225 Difference]: With dead ends: 30651 [2018-12-30 22:30:36,667 INFO L226 Difference]: Without dead ends: 16062 [2018-12-30 22:30:36,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 611 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:30:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16062 states. [2018-12-30 22:30:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16062 to 12195. [2018-12-30 22:30:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12195 states. [2018-12-30 22:30:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12195 states to 12195 states and 13036 transitions. [2018-12-30 22:30:36,840 INFO L78 Accepts]: Start accepts. Automaton has 12195 states and 13036 transitions. Word has length 612 [2018-12-30 22:30:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:30:36,840 INFO L480 AbstractCegarLoop]: Abstraction has 12195 states and 13036 transitions. [2018-12-30 22:30:36,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 22:30:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 12195 states and 13036 transitions. [2018-12-30 22:30:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2018-12-30 22:30:36,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:30:36,851 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:30:36,851 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:30:36,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:30:36,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1072037694, now seen corresponding path program 1 times [2018-12-30 22:30:36,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:30:36,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:30:36,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:30:36,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:30:36,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:30:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:30:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 922 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-12-30 22:30:37,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:30:37,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 22:30:37,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 22:30:37,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 22:30:37,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:30:37,480 INFO L87 Difference]: Start difference. First operand 12195 states and 13036 transitions. Second operand 3 states. [2018-12-30 22:30:38,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:30:38,809 INFO L93 Difference]: Finished difference Result 23464 states and 25118 transitions. [2018-12-30 22:30:38,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 22:30:38,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 661 [2018-12-30 22:30:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:30:38,821 INFO L225 Difference]: With dead ends: 23464 [2018-12-30 22:30:38,821 INFO L226 Difference]: Without dead ends: 11821 [2018-12-30 22:30:38,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:30:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11821 states. [2018-12-30 22:30:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11821 to 11267. [2018-12-30 22:30:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11267 states. [2018-12-30 22:30:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11267 states to 11267 states and 12020 transitions. [2018-12-30 22:30:38,961 INFO L78 Accepts]: Start accepts. Automaton has 11267 states and 12020 transitions. Word has length 661 [2018-12-30 22:30:38,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:30:38,962 INFO L480 AbstractCegarLoop]: Abstraction has 11267 states and 12020 transitions. [2018-12-30 22:30:38,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 22:30:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 11267 states and 12020 transitions. [2018-12-30 22:30:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 738 [2018-12-30 22:30:38,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:30:38,972 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:30:38,972 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:30:38,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:30:38,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1864892644, now seen corresponding path program 1 times [2018-12-30 22:30:38,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:30:38,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:30:38,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:30:38,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:30:38,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:30:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:30:39,488 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-12-30 22:30:39,693 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 3 [2018-12-30 22:30:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2114 backedges. 736 proven. 54 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2018-12-30 22:30:40,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:30:40,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:30:40,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:30:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:30:40,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:30:41,591 WARN L181 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-12-30 22:30:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2114 backedges. 448 proven. 342 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2018-12-30 22:30:45,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:30:45,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-12-30 22:30:45,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 22:30:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 22:30:45,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-30 22:30:45,233 INFO L87 Difference]: Start difference. First operand 11267 states and 12020 transitions. Second operand 9 states. [2018-12-30 22:30:51,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:30:51,835 INFO L93 Difference]: Finished difference Result 23477 states and 25035 transitions. [2018-12-30 22:30:51,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 22:30:51,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 737 [2018-12-30 22:30:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:30:51,837 INFO L225 Difference]: With dead ends: 23477 [2018-12-30 22:30:51,837 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 22:30:51,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 691 SyntacticMatches, 47 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-12-30 22:30:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 22:30:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 22:30:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 22:30:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 22:30:51,845 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 737 [2018-12-30 22:30:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:30:51,845 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 22:30:51,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 22:30:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 22:30:51,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 22:30:51,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 22:30:51,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:51,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:51,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:51,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:51,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:51,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:51,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:52,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:52,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:52,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,742 WARN L181 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 688 DAG size of output: 555 [2018-12-30 22:30:53,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:53,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:54,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:54,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:54,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:54,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:54,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:54,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:54,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:54,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:54,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:54,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:54,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:55,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:55,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:30:55,110 WARN L181 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 688 DAG size of output: 555 [2018-12-30 22:31:00,475 WARN L181 SmtUtils]: Spent 5.36 s on a formula simplification. DAG size of input: 532 DAG size of output: 109 [2018-12-30 22:31:05,548 WARN L181 SmtUtils]: Spent 5.07 s on a formula simplification. DAG size of input: 532 DAG size of output: 109 [2018-12-30 22:31:05,552 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-12-30 22:31:05,552 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-12-30 22:31:05,552 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-12-30 22:31:05,552 INFO L451 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-12-30 22:31:05,553 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,553 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,553 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,553 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,553 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,553 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,553 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,553 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-30 22:31:05,553 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-12-30 22:31:05,553 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-30 22:31:05,553 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,554 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,554 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,554 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,554 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,554 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,554 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,554 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,554 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,554 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-12-30 22:31:05,554 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-12-30 22:31:05,554 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-12-30 22:31:05,554 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,555 INFO L444 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse12 (= ~a25~0 9)) (.cse22 (+ ~a23~0 43)) (.cse11 (< 138 ~a23~0))) (let ((.cse18 (= ~a4~0 1)) (.cse9 (or (<= .cse22 0) .cse11)) (.cse8 (not .cse12)) (.cse0 (= 1 ~a3~0)) (.cse4 (= 15 ~a8~0)) (.cse5 (= 1 ~a4~0))) (let ((.cse15 (<= ~a29~0 274)) (.cse14 (or (and .cse8 .cse0 .cse4 .cse5) (and .cse0 .cse4 .cse5 .cse11))) (.cse3 (let ((.cse23 (< 245 ~a29~0))) (or (and .cse23 .cse9) (and .cse8 .cse23)))) (.cse13 (= ~a25~0 13)) (.cse16 (= ~a25~0 12)) (.cse10 (<= (+ ~a29~0 580292) 0)) (.cse2 (= ~a8~0 15)) (.cse20 (not .cse18)) (.cse1 (<= ~a23~0 247)) (.cse21 (<= ~a29~0 140)) (.cse19 (< 0 .cse22)) (.cse17 (<= 141 ~a29~0)) (.cse6 (= ~a25~0 10)) (.cse7 (<= ~a23~0 306))) (or (and .cse0 .cse1 (and .cse2 .cse3)) (and .cse0 .cse4 .cse5 .cse6) (and .cse7 (and .cse8 .cse0 (<= ~a25~0 12) .cse4 .cse5) .cse9) (and (and (and .cse0 .cse10 .cse5 .cse11) .cse4) .cse12) (and .cse13 .cse14 .cse9) (and .cse0 .cse15 (and .cse16 .cse2 .cse17)) (and .cse16 .cse0 .cse18 .cse4 (<= 312 ~a23~0)) (and (and .cse19 .cse20) .cse12 .cse0 .cse15 .cse4 .cse1) (and .cse16 .cse0 .cse4 .cse1) (and .cse0 (and .cse8 .cse20) .cse4 .cse1 .cse9) (and .cse17 .cse14) (and (and (and (and .cse16 .cse3) (<= ~a29~0 275)) .cse0) .cse4) (and (and .cse13 .cse20) .cse0 .cse4 .cse1) (and (and .cse16 .cse20) .cse0 .cse10 .cse4) (and .cse0 (and .cse2 .cse20) (exists ((v_~a29~0_508 Int)) (and (<= v_~a29~0_508 245) (= (+ ~a29~0 554771) (* 3 v_~a29~0_508)) (< 140 v_~a29~0_508))) .cse1) (and (and .cse8 .cse20 .cse21) .cse0 .cse4 .cse1) (and (<= ~a4~0 0) .cse0 .cse4 .cse6 .cse21) (and (or (and .cse12 .cse0 .cse4 .cse5 .cse11) (and .cse4 .cse5 .cse19 .cse0 .cse17) (and (and (<= ~a29~0 277) .cse6 .cse11) (< 140 ~a29~0) .cse0 .cse4)) .cse7))))) [2018-12-30 22:31:05,555 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,555 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,555 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,555 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,555 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,555 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,556 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,556 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,556 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-12-30 22:31:05,556 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-12-30 22:31:05,556 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-12-30 22:31:05,556 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-12-30 22:31:05,556 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-12-30 22:31:05,556 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-12-30 22:31:05,556 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-12-30 22:31:05,556 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,556 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,557 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,557 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,557 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,557 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,557 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,557 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,557 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,557 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,557 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-12-30 22:31:05,557 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-12-30 22:31:05,558 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-12-30 22:31:05,558 INFO L448 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-12-30 22:31:05,558 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,558 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,558 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,558 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,558 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,558 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-12-30 22:31:05,558 INFO L448 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-12-30 22:31:05,558 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-12-30 22:31:05,558 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,558 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,559 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 174) no Hoare annotation was computed. [2018-12-30 22:31:05,559 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,559 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,559 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-12-30 22:31:05,559 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-12-30 22:31:05,559 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,559 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,559 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,559 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,559 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,559 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,560 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-12-30 22:31:05,560 INFO L448 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-12-30 22:31:05,560 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,560 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,560 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-30 22:31:05,560 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-12-30 22:31:05,560 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-12-30 22:31:05,560 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,560 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,560 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,560 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,560 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,561 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,561 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,561 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-12-30 22:31:05,561 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-12-30 22:31:05,561 INFO L448 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-12-30 22:31:05,561 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-12-30 22:31:05,561 INFO L448 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-12-30 22:31:05,561 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-12-30 22:31:05,561 INFO L448 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-12-30 22:31:05,561 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,561 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,561 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 22:31:05,562 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-12-30 22:31:05,562 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-12-30 22:31:05,562 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,562 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,562 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,562 INFO L448 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,562 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,562 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-12-30 22:31:05,562 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-12-30 22:31:05,562 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-12-30 22:31:05,562 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,562 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,563 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,563 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,563 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,563 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,563 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-12-30 22:31:05,563 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-12-30 22:31:05,563 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-12-30 22:31:05,563 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,563 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,563 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,563 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,563 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,564 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,564 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,564 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 22:31:05,564 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,564 INFO L448 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-12-30 22:31:05,564 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-12-30 22:31:05,564 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-12-30 22:31:05,564 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,564 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,564 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,565 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,565 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,565 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,565 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,565 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,565 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,565 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,565 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,565 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-12-30 22:31:05,565 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-12-30 22:31:05,566 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-12-30 22:31:05,566 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-12-30 22:31:05,566 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-12-30 22:31:05,566 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,566 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,566 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,566 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,566 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,566 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,566 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,566 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-12-30 22:31:05,566 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-12-30 22:31:05,567 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-12-30 22:31:05,567 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,567 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,567 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,567 INFO L448 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-12-30 22:31:05,567 INFO L448 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-12-30 22:31:05,567 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,567 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,567 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,567 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,567 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,567 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-12-30 22:31:05,568 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-12-30 22:31:05,568 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,568 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,568 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-12-30 22:31:05,568 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-12-30 22:31:05,568 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,568 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,568 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,568 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,568 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,568 INFO L448 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,568 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-12-30 22:31:05,568 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-12-30 22:31:05,569 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-12-30 22:31:05,569 INFO L448 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-12-30 22:31:05,569 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,569 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,569 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,569 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,569 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,569 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,569 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,569 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,569 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-12-30 22:31:05,569 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-12-30 22:31:05,570 INFO L448 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-12-30 22:31:05,570 INFO L448 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-12-30 22:31:05,570 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-12-30 22:31:05,570 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-12-30 22:31:05,570 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,570 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,570 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,570 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,570 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,570 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,570 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,570 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-12-30 22:31:05,570 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-12-30 22:31:05,571 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 22:31:05,571 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,571 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,571 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,571 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,571 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,571 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,571 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-12-30 22:31:05,571 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-12-30 22:31:05,571 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,571 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,571 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,571 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,572 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,572 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,572 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,572 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-12-30 22:31:05,572 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,572 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,572 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,572 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-12-30 22:31:05,572 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-12-30 22:31:05,572 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-12-30 22:31:05,572 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,572 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-12-30 22:31:05,573 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,573 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-12-30 22:31:05,573 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,573 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,573 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,573 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,573 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,573 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,573 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-12-30 22:31:05,573 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-12-30 22:31:05,573 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-12-30 22:31:05,573 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,574 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,574 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,574 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 22:31:05,574 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,574 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,574 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,574 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,574 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,574 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,574 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,574 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-12-30 22:31:05,574 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-12-30 22:31:05,575 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-12-30 22:31:05,575 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,575 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-12-30 22:31:05,575 INFO L448 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-12-30 22:31:05,575 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,575 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,575 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,575 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,575 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,575 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,575 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-12-30 22:31:05,576 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-12-30 22:31:05,576 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-12-30 22:31:05,576 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,576 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,576 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,576 INFO L444 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse12 (= ~a25~0 9)) (.cse22 (+ ~a23~0 43)) (.cse11 (< 138 ~a23~0))) (let ((.cse18 (= ~a4~0 1)) (.cse9 (or (<= .cse22 0) .cse11)) (.cse8 (not .cse12)) (.cse0 (= 1 ~a3~0)) (.cse4 (= 15 ~a8~0)) (.cse5 (= 1 ~a4~0))) (let ((.cse15 (<= ~a29~0 274)) (.cse14 (or (and .cse8 .cse0 .cse4 .cse5) (and .cse0 .cse4 .cse5 .cse11))) (.cse3 (let ((.cse23 (< 245 ~a29~0))) (or (and .cse23 .cse9) (and .cse8 .cse23)))) (.cse13 (= ~a25~0 13)) (.cse16 (= ~a25~0 12)) (.cse10 (<= (+ ~a29~0 580292) 0)) (.cse2 (= ~a8~0 15)) (.cse20 (not .cse18)) (.cse1 (<= ~a23~0 247)) (.cse21 (<= ~a29~0 140)) (.cse19 (< 0 .cse22)) (.cse17 (<= 141 ~a29~0)) (.cse6 (= ~a25~0 10)) (.cse7 (<= ~a23~0 306))) (or (and .cse0 .cse1 (and .cse2 .cse3)) (and .cse0 .cse4 .cse5 .cse6) (and .cse7 (and .cse8 .cse0 (<= ~a25~0 12) .cse4 .cse5) .cse9) (and (and (and .cse0 .cse10 .cse5 .cse11) .cse4) .cse12) (and .cse13 .cse14 .cse9) (and .cse0 .cse15 (and .cse16 .cse2 .cse17)) (and .cse16 .cse0 .cse18 .cse4 (<= 312 ~a23~0)) (and (and .cse19 .cse20) .cse12 .cse0 .cse15 .cse4 .cse1) (and .cse16 .cse0 .cse4 .cse1) (and .cse0 (and .cse8 .cse20) .cse4 .cse1 .cse9) (and .cse17 .cse14) (and (and (and (and .cse16 .cse3) (<= ~a29~0 275)) .cse0) .cse4) (and (and .cse13 .cse20) .cse0 .cse4 .cse1) (and (and .cse16 .cse20) .cse0 .cse10 .cse4) (and .cse0 (and .cse2 .cse20) (exists ((v_~a29~0_508 Int)) (and (<= v_~a29~0_508 245) (= (+ ~a29~0 554771) (* 3 v_~a29~0_508)) (< 140 v_~a29~0_508))) .cse1) (and (and .cse8 .cse20 .cse21) .cse0 .cse4 .cse1) (and (<= ~a4~0 0) .cse0 .cse4 .cse6 .cse21) (and (or (and .cse12 .cse0 .cse4 .cse5 .cse11) (and .cse4 .cse5 .cse19 .cse0 .cse17) (and (and (<= ~a29~0 277) .cse6 .cse11) (< 140 ~a29~0) .cse0 .cse4)) .cse7))))) [2018-12-30 22:31:05,577 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,577 INFO L448 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-12-30 22:31:05,577 INFO L448 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-12-30 22:31:05,577 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,577 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,577 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-12-30 22:31:05,577 INFO L448 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,577 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,577 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:31:05,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,590 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,590 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,601 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,602 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,602 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,608 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,608 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 10:31:05 BoogieIcfgContainer [2018-12-30 22:31:05,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 22:31:05,618 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 22:31:05,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 22:31:05,619 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 22:31:05,625 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 10:29:13" (3/4) ... [2018-12-30 22:31:05,641 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 22:31:05,707 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 22:31:05,710 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 22:31:05,752 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 == a3 && a23 <= 247) && a8 == 15 && ((245 < a29 && (a23 + 43 <= 0 || 138 < a23)) || (!(a25 == 9) && 245 < a29))) || (((1 == a3 && 15 == a8) && 1 == a4) && a25 == 10)) || ((a23 <= 306 && (((!(a25 == 9) && 1 == a3) && a25 <= 12) && 15 == a8) && 1 == a4) && (a23 + 43 <= 0 || 138 < a23))) || (((((1 == a3 && a29 + 580292 <= 0) && 1 == a4) && 138 < a23) && 15 == a8) && a25 == 9)) || ((a25 == 13 && ((((!(a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4) || (((1 == a3 && 15 == a8) && 1 == a4) && 138 < a23))) && (a23 + 43 <= 0 || 138 < a23))) || ((1 == a3 && a29 <= 274) && (a25 == 12 && a8 == 15) && 141 <= a29)) || ((((a25 == 12 && 1 == a3) && a4 == 1) && 15 == a8) && 312 <= a23)) || ((((((0 < a23 + 43 && !(a4 == 1)) && a25 == 9) && 1 == a3) && a29 <= 274) && 15 == a8) && a23 <= 247)) || (((a25 == 12 && 1 == a3) && 15 == a8) && a23 <= 247)) || ((((1 == a3 && !(a25 == 9) && !(a4 == 1)) && 15 == a8) && a23 <= 247) && (a23 + 43 <= 0 || 138 < a23))) || (141 <= a29 && ((((!(a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4) || (((1 == a3 && 15 == a8) && 1 == a4) && 138 < a23)))) || ((((a25 == 12 && ((245 < a29 && (a23 + 43 <= 0 || 138 < a23)) || (!(a25 == 9) && 245 < a29))) && a29 <= 275) && 1 == a3) && 15 == a8)) || ((((a25 == 13 && !(a4 == 1)) && 1 == a3) && 15 == a8) && a23 <= 247)) || ((((a25 == 12 && !(a4 == 1)) && 1 == a3) && a29 + 580292 <= 0) && 15 == a8)) || (((1 == a3 && a8 == 15 && !(a4 == 1)) && (\exists v_~a29~0_508 : int :: (v_~a29~0_508 <= 245 && a29 + 554771 == 3 * v_~a29~0_508) && 140 < v_~a29~0_508)) && a23 <= 247)) || (((((!(a25 == 9) && !(a4 == 1)) && a29 <= 140) && 1 == a3) && 15 == a8) && a23 <= 247)) || ((((a4 <= 0 && 1 == a3) && 15 == a8) && a25 == 10) && a29 <= 140)) || (((((((a25 == 9 && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23) || ((((15 == a8 && 1 == a4) && 0 < a23 + 43) && 1 == a3) && 141 <= a29)) || (((((a29 <= 277 && a25 == 10) && 138 < a23) && 140 < a29) && 1 == a3) && 15 == a8)) && a23 <= 306) [2018-12-30 22:31:05,755 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 == a3 && a23 <= 247) && a8 == 15 && ((245 < a29 && (a23 + 43 <= 0 || 138 < a23)) || (!(a25 == 9) && 245 < a29))) || (((1 == a3 && 15 == a8) && 1 == a4) && a25 == 10)) || ((a23 <= 306 && (((!(a25 == 9) && 1 == a3) && a25 <= 12) && 15 == a8) && 1 == a4) && (a23 + 43 <= 0 || 138 < a23))) || (((((1 == a3 && a29 + 580292 <= 0) && 1 == a4) && 138 < a23) && 15 == a8) && a25 == 9)) || ((a25 == 13 && ((((!(a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4) || (((1 == a3 && 15 == a8) && 1 == a4) && 138 < a23))) && (a23 + 43 <= 0 || 138 < a23))) || ((1 == a3 && a29 <= 274) && (a25 == 12 && a8 == 15) && 141 <= a29)) || ((((a25 == 12 && 1 == a3) && a4 == 1) && 15 == a8) && 312 <= a23)) || ((((((0 < a23 + 43 && !(a4 == 1)) && a25 == 9) && 1 == a3) && a29 <= 274) && 15 == a8) && a23 <= 247)) || (((a25 == 12 && 1 == a3) && 15 == a8) && a23 <= 247)) || ((((1 == a3 && !(a25 == 9) && !(a4 == 1)) && 15 == a8) && a23 <= 247) && (a23 + 43 <= 0 || 138 < a23))) || (141 <= a29 && ((((!(a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4) || (((1 == a3 && 15 == a8) && 1 == a4) && 138 < a23)))) || ((((a25 == 12 && ((245 < a29 && (a23 + 43 <= 0 || 138 < a23)) || (!(a25 == 9) && 245 < a29))) && a29 <= 275) && 1 == a3) && 15 == a8)) || ((((a25 == 13 && !(a4 == 1)) && 1 == a3) && 15 == a8) && a23 <= 247)) || ((((a25 == 12 && !(a4 == 1)) && 1 == a3) && a29 + 580292 <= 0) && 15 == a8)) || (((1 == a3 && a8 == 15 && !(a4 == 1)) && (\exists v_~a29~0_508 : int :: (v_~a29~0_508 <= 245 && a29 + 554771 == 3 * v_~a29~0_508) && 140 < v_~a29~0_508)) && a23 <= 247)) || (((((!(a25 == 9) && !(a4 == 1)) && a29 <= 140) && 1 == a3) && 15 == a8) && a23 <= 247)) || ((((a4 <= 0 && 1 == a3) && 15 == a8) && a25 == 10) && a29 <= 140)) || (((((((a25 == 9 && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23) || ((((15 == a8 && 1 == a4) && 0 < a23 + 43) && 1 == a3) && 141 <= a29)) || (((((a29 <= 277 && a25 == 10) && 138 < a23) && 140 < a29) && 1 == a3) && 15 == a8)) && a23 <= 306) [2018-12-30 22:31:05,942 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 22:31:05,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 22:31:05,943 INFO L168 Benchmark]: Toolchain (without parser) took 118104.78 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 942.0 MB in the beginning and 1.5 GB in the end (delta: -593.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-30 22:31:05,945 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 22:31:05,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 921.36 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 893.7 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. [2018-12-30 22:31:05,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 291.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 893.7 MB in the beginning and 1.1 GB in the end (delta: -207.2 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-12-30 22:31:05,947 INFO L168 Benchmark]: Boogie Preprocessor took 127.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-30 22:31:05,948 INFO L168 Benchmark]: RCFGBuilder took 4612.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 915.9 MB in the end (delta: 171.2 MB). Peak memory consumption was 171.2 MB. Max. memory is 11.5 GB. [2018-12-30 22:31:05,949 INFO L168 Benchmark]: TraceAbstraction took 111820.73 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 915.9 MB in the beginning and 1.6 GB in the end (delta: -658.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-30 22:31:05,949 INFO L168 Benchmark]: Witness Printer took 323.73 ms. Allocated memory is still 2.8 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2018-12-30 22:31:05,952 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 921.36 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 893.7 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 291.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 893.7 MB in the beginning and 1.1 GB in the end (delta: -207.2 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4612.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 915.9 MB in the end (delta: 171.2 MB). Peak memory consumption was 171.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 111820.73 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 915.9 MB in the beginning and 1.6 GB in the end (delta: -658.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 323.73 ms. Allocated memory is still 2.8 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 174]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2018-12-30 22:31:05,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] Derived loop invariant: ((((((((((((((((((1 == a3 && a23 <= 247) && a8 == 15 && ((245 < a29 && (a23 + 43 <= 0 || 138 < a23)) || (!(a25 == 9) && 245 < a29))) || (((1 == a3 && 15 == a8) && 1 == a4) && a25 == 10)) || ((a23 <= 306 && (((!(a25 == 9) && 1 == a3) && a25 <= 12) && 15 == a8) && 1 == a4) && (a23 + 43 <= 0 || 138 < a23))) || (((((1 == a3 && a29 + 580292 <= 0) && 1 == a4) && 138 < a23) && 15 == a8) && a25 == 9)) || ((a25 == 13 && ((((!(a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4) || (((1 == a3 && 15 == a8) && 1 == a4) && 138 < a23))) && (a23 + 43 <= 0 || 138 < a23))) || ((1 == a3 && a29 <= 274) && (a25 == 12 && a8 == 15) && 141 <= a29)) || ((((a25 == 12 && 1 == a3) && a4 == 1) && 15 == a8) && 312 <= a23)) || ((((((0 < a23 + 43 && !(a4 == 1)) && a25 == 9) && 1 == a3) && a29 <= 274) && 15 == a8) && a23 <= 247)) || (((a25 == 12 && 1 == a3) && 15 == a8) && a23 <= 247)) || ((((1 == a3 && !(a25 == 9) && !(a4 == 1)) && 15 == a8) && a23 <= 247) && (a23 + 43 <= 0 || 138 < a23))) || (141 <= a29 && ((((!(a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4) || (((1 == a3 && 15 == a8) && 1 == a4) && 138 < a23)))) || ((((a25 == 12 && ((245 < a29 && (a23 + 43 <= 0 || 138 < a23)) || (!(a25 == 9) && 245 < a29))) && a29 <= 275) && 1 == a3) && 15 == a8)) || ((((a25 == 13 && !(a4 == 1)) && 1 == a3) && 15 == a8) && a23 <= 247)) || ((((a25 == 12 && !(a4 == 1)) && 1 == a3) && a29 + 580292 <= 0) && 15 == a8)) || (((1 == a3 && a8 == 15 && !(a4 == 1)) && (\exists v_~a29~0_508 : int :: (v_~a29~0_508 <= 245 && a29 + 554771 == 3 * v_~a29~0_508) && 140 < v_~a29~0_508)) && a23 <= 247)) || (((((!(a25 == 9) && !(a4 == 1)) && a29 <= 140) && 1 == a3) && 15 == a8) && a23 <= 247)) || ((((a4 <= 0 && 1 == a3) && 15 == a8) && a25 == 10) && a29 <= 140)) || (((((((a25 == 9 && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23) || ((((15 == a8 && 1 == a4) && 0 < a23 + 43) && 1 == a3) && 141 <= a29)) || (((((a29 <= 277 && a25 == 10) && 138 < a23) && 140 < a29) && 1 == a3) && 15 == a8)) && a23 <= 306) - InvariantResult [Line: 22]: Loop Invariant [2018-12-30 22:31:05,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2018-12-30 22:31:05,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] Derived loop invariant: ((((((((((((((((((1 == a3 && a23 <= 247) && a8 == 15 && ((245 < a29 && (a23 + 43 <= 0 || 138 < a23)) || (!(a25 == 9) && 245 < a29))) || (((1 == a3 && 15 == a8) && 1 == a4) && a25 == 10)) || ((a23 <= 306 && (((!(a25 == 9) && 1 == a3) && a25 <= 12) && 15 == a8) && 1 == a4) && (a23 + 43 <= 0 || 138 < a23))) || (((((1 == a3 && a29 + 580292 <= 0) && 1 == a4) && 138 < a23) && 15 == a8) && a25 == 9)) || ((a25 == 13 && ((((!(a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4) || (((1 == a3 && 15 == a8) && 1 == a4) && 138 < a23))) && (a23 + 43 <= 0 || 138 < a23))) || ((1 == a3 && a29 <= 274) && (a25 == 12 && a8 == 15) && 141 <= a29)) || ((((a25 == 12 && 1 == a3) && a4 == 1) && 15 == a8) && 312 <= a23)) || ((((((0 < a23 + 43 && !(a4 == 1)) && a25 == 9) && 1 == a3) && a29 <= 274) && 15 == a8) && a23 <= 247)) || (((a25 == 12 && 1 == a3) && 15 == a8) && a23 <= 247)) || ((((1 == a3 && !(a25 == 9) && !(a4 == 1)) && 15 == a8) && a23 <= 247) && (a23 + 43 <= 0 || 138 < a23))) || (141 <= a29 && ((((!(a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4) || (((1 == a3 && 15 == a8) && 1 == a4) && 138 < a23)))) || ((((a25 == 12 && ((245 < a29 && (a23 + 43 <= 0 || 138 < a23)) || (!(a25 == 9) && 245 < a29))) && a29 <= 275) && 1 == a3) && 15 == a8)) || ((((a25 == 13 && !(a4 == 1)) && 1 == a3) && 15 == a8) && a23 <= 247)) || ((((a25 == 12 && !(a4 == 1)) && 1 == a3) && a29 + 580292 <= 0) && 15 == a8)) || (((1 == a3 && a8 == 15 && !(a4 == 1)) && (\exists v_~a29~0_508 : int :: (v_~a29~0_508 <= 245 && a29 + 554771 == 3 * v_~a29~0_508) && 140 < v_~a29~0_508)) && a23 <= 247)) || (((((!(a25 == 9) && !(a4 == 1)) && a29 <= 140) && 1 == a3) && 15 == a8) && a23 <= 247)) || ((((a4 <= 0 && 1 == a3) && 15 == a8) && a25 == 10) && a29 <= 140)) || (((((((a25 == 9 && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23) || ((((15 == a8 && 1 == a4) && 0 < a23 + 43) && 1 == a3) && 141 <= a29)) || (((((a29 <= 277 && a25 == 10) && 138 < a23) && 140 < a29) && 1 == a3) && 15 == a8)) && a23 <= 306) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. SAFE Result, 111.6s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 73.7s AutomataDifference, 0.0s DeadEndRemovalTime, 13.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1815 SDtfs, 13893 SDslu, 1312 SDs, 0 SdLazy, 43145 SolverSat, 5750 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4172 GetRequests, 4004 SyntacticMatches, 57 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15332occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 37399 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 188 NumberOfFragments, 953 HoareAnnotationTreeSize, 3 FomulaSimplifications, 895010 FormulaSimplificationTreeSizeReduction, 3.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 238888 FormulaSimplificationTreeSizeReductionInter, 10.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 10399 NumberOfCodeBlocks, 10399 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 10374 ConstructedInterpolants, 302 QuantifiedInterpolants, 23692216 SizeOfPredicates, 21 NumberOfNonLiveVariables, 5325 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 14002/16332 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...