./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_14-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5a3d22d49117f02662b197492bc1b16616a2878 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:39:17,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:39:17,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:39:17,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:39:17,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:39:17,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:39:17,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:39:17,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:39:17,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:39:17,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:39:17,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:39:17,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:39:17,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:39:17,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:39:17,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:39:17,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:39:17,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:39:17,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:39:17,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:39:17,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:39:17,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:39:17,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:39:17,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:39:17,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:39:17,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:39:17,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:39:17,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:39:17,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:39:17,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:39:17,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:39:17,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:39:17,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:39:17,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:39:17,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:39:17,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:39:17,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:39:17,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:39:17,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:39:17,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:39:17,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:39:17,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:39:17,462 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:39:17,479 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:39:17,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:39:17,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:39:17,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:39:17,482 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:39:17,482 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:39:17,482 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:39:17,482 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:39:17,483 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:39:17,483 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:39:17,483 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:39:17,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:39:17,484 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:39:17,484 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:39:17,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:39:17,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:39:17,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:39:17,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:39:17,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:39:17,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:39:17,486 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:39:17,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:39:17,487 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:39:17,487 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:39:17,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:39:17,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:39:17,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:39:17,488 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:39:17,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:39:17,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:39:17,489 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:39:17,489 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:39:17,490 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:39:17,491 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2019-11-28 20:39:17,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:39:17,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:39:17,856 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:39:17,857 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:39:17,858 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:39:17,858 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-1.c [2019-11-28 20:39:17,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce74c47f/e013a550d0944add879f7ac8bcde5cdb/FLAG929db1868 [2019-11-28 20:39:18,403 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:39:18,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2019-11-28 20:39:18,412 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce74c47f/e013a550d0944add879f7ac8bcde5cdb/FLAG929db1868 [2019-11-28 20:39:18,774 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce74c47f/e013a550d0944add879f7ac8bcde5cdb [2019-11-28 20:39:18,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:39:18,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:39:18,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:39:18,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:39:18,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:39:18,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:39:18" (1/1) ... [2019-11-28 20:39:18,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600cef8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:18, skipping insertion in model container [2019-11-28 20:39:18,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:39:18" (1/1) ... [2019-11-28 20:39:18,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:39:18,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:39:19,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:39:19,020 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:39:19,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:39:19,129 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:39:19,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:19 WrapperNode [2019-11-28 20:39:19,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:39:19,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:39:19,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:39:19,131 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:39:19,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:19" (1/1) ... [2019-11-28 20:39:19,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:19" (1/1) ... [2019-11-28 20:39:19,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:39:19,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:39:19,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:39:19,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:39:19,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:19" (1/1) ... [2019-11-28 20:39:19,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:19" (1/1) ... [2019-11-28 20:39:19,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:19" (1/1) ... [2019-11-28 20:39:19,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:19" (1/1) ... [2019-11-28 20:39:19,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:19" (1/1) ... [2019-11-28 20:39:19,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:19" (1/1) ... [2019-11-28 20:39:19,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:19" (1/1) ... [2019-11-28 20:39:19,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:39:19,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:39:19,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:39:19,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:39:19,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:19" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:39:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:39:19,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:39:19,639 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:39:19,639 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:39:19,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:19 BoogieIcfgContainer [2019-11-28 20:39:19,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:39:19,641 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:39:19,641 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:39:19,645 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:39:19,646 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:39:19,646 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:39:18" (1/3) ... [2019-11-28 20:39:19,647 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@786c86c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:39:19, skipping insertion in model container [2019-11-28 20:39:19,648 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:39:19,648 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:19" (2/3) ... [2019-11-28 20:39:19,648 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@786c86c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:39:19, skipping insertion in model container [2019-11-28 20:39:19,649 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:39:19,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:19" (3/3) ... [2019-11-28 20:39:19,651 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_14-1.c [2019-11-28 20:39:19,696 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:39:19,696 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:39:19,697 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:39:19,697 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:39:19,697 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:39:19,697 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:39:19,697 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:39:19,698 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:39:19,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2019-11-28 20:39:19,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2019-11-28 20:39:19,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:19,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:19,750 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:19,750 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 20:39:19,750 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:39:19,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2019-11-28 20:39:19,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2019-11-28 20:39:19,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:19,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:19,756 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:19,756 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 20:39:19,763 INFO L794 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 16#L209-1true [2019-11-28 20:39:19,765 INFO L796 eck$LassoCheckResult]: Loop: 16#L209-1true assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 47#L53true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 48#L86true assume 0 != main_~p1~0;main_~lk1~0 := 1; 33#L86-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 51#L90-1true assume !(0 != main_~p3~0); 42#L94-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 10#L98-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 4#L102-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 7#L106-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 23#L110-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 17#L114-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 34#L118-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 37#L122-1true assume !(0 != main_~p11~0); 31#L126-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 49#L130-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 39#L134-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 44#L138-1true assume !(0 != main_~p1~0); 26#L144-1true assume !(0 != main_~p2~0); 45#L149-1true assume !(0 != main_~p3~0); 25#L154-1true assume !(0 != main_~p4~0); 32#L159-1true assume !(0 != main_~p5~0); 14#L164-1true assume !(0 != main_~p6~0); 18#L169-1true assume !(0 != main_~p7~0); 50#L174-1true assume !(0 != main_~p8~0); 5#L179-1true assume !(0 != main_~p9~0); 35#L184-1true assume !(0 != main_~p10~0); 41#L189-1true assume !(0 != main_~p11~0); 22#L194-1true assume !(0 != main_~p12~0); 28#L199-1true assume !(0 != main_~p13~0); 9#L204-1true assume !(0 != main_~p14~0); 16#L209-1true [2019-11-28 20:39:19,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:19,771 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 20:39:19,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:19,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799024476] [2019-11-28 20:39:19,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:19,879 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:19,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:19,881 INFO L82 PathProgramCache]: Analyzing trace with hash -78752615, now seen corresponding path program 1 times [2019-11-28 20:39:19,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:19,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624610468] [2019-11-28 20:39:19,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:19,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624610468] [2019-11-28 20:39:19,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:19,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:19,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612979608] [2019-11-28 20:39:20,005 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:20,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:20,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:20,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:20,024 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-11-28 20:39:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:20,072 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2019-11-28 20:39:20,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:20,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 177 transitions. [2019-11-28 20:39:20,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2019-11-28 20:39:20,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 88 states and 142 transitions. [2019-11-28 20:39:20,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-11-28 20:39:20,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2019-11-28 20:39:20,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 142 transitions. [2019-11-28 20:39:20,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:20,094 INFO L688 BuchiCegarLoop]: Abstraction has 88 states and 142 transitions. [2019-11-28 20:39:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 142 transitions. [2019-11-28 20:39:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-11-28 20:39:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 20:39:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 142 transitions. [2019-11-28 20:39:20,129 INFO L711 BuchiCegarLoop]: Abstraction has 88 states and 142 transitions. [2019-11-28 20:39:20,129 INFO L591 BuchiCegarLoop]: Abstraction has 88 states and 142 transitions. [2019-11-28 20:39:20,130 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:39:20,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 142 transitions. [2019-11-28 20:39:20,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2019-11-28 20:39:20,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:20,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:20,134 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:20,134 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 20:39:20,135 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 206#L209-1 [2019-11-28 20:39:20,135 INFO L796 eck$LassoCheckResult]: Loop: 206#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 203#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 204#L86 assume !(0 != main_~p1~0); 209#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 244#L90-1 assume !(0 != main_~p3~0); 243#L94-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 242#L98-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 241#L102-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 240#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 239#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 238#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 237#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 236#L122-1 assume !(0 != main_~p11~0); 235#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 234#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 233#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 232#L138-1 assume !(0 != main_~p1~0); 157#L144-1 assume !(0 != main_~p2~0); 159#L149-1 assume !(0 != main_~p3~0); 229#L154-1 assume !(0 != main_~p4~0); 227#L159-1 assume !(0 != main_~p5~0); 225#L164-1 assume !(0 != main_~p6~0); 200#L169-1 assume !(0 != main_~p7~0); 161#L174-1 assume !(0 != main_~p8~0); 171#L179-1 assume !(0 != main_~p9~0); 172#L184-1 assume !(0 != main_~p10~0); 177#L189-1 assume !(0 != main_~p11~0); 189#L194-1 assume !(0 != main_~p12~0); 212#L199-1 assume !(0 != main_~p13~0); 211#L204-1 assume !(0 != main_~p14~0); 206#L209-1 [2019-11-28 20:39:20,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:20,136 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 20:39:20,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:20,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515114667] [2019-11-28 20:39:20,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:20,166 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:20,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:20,168 INFO L82 PathProgramCache]: Analyzing trace with hash -588225705, now seen corresponding path program 1 times [2019-11-28 20:39:20,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:20,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149537913] [2019-11-28 20:39:20,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:20,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149537913] [2019-11-28 20:39:20,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:20,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:20,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974389051] [2019-11-28 20:39:20,220 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:20,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:20,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:20,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:20,222 INFO L87 Difference]: Start difference. First operand 88 states and 142 transitions. cyclomatic complexity: 56 Second operand 3 states. [2019-11-28 20:39:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:20,257 INFO L93 Difference]: Finished difference Result 173 states and 277 transitions. [2019-11-28 20:39:20,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:20,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 277 transitions. [2019-11-28 20:39:20,262 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2019-11-28 20:39:20,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 173 states and 277 transitions. [2019-11-28 20:39:20,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2019-11-28 20:39:20,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2019-11-28 20:39:20,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 277 transitions. [2019-11-28 20:39:20,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:20,269 INFO L688 BuchiCegarLoop]: Abstraction has 173 states and 277 transitions. [2019-11-28 20:39:20,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 277 transitions. [2019-11-28 20:39:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-11-28 20:39:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-28 20:39:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 277 transitions. [2019-11-28 20:39:20,288 INFO L711 BuchiCegarLoop]: Abstraction has 173 states and 277 transitions. [2019-11-28 20:39:20,288 INFO L591 BuchiCegarLoop]: Abstraction has 173 states and 277 transitions. [2019-11-28 20:39:20,288 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:39:20,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 277 transitions. [2019-11-28 20:39:20,292 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2019-11-28 20:39:20,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:20,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:20,293 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:20,293 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 20:39:20,294 INFO L794 eck$LassoCheckResult]: Stem: 477#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 478#L209-1 [2019-11-28 20:39:20,294 INFO L796 eck$LassoCheckResult]: Loop: 478#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 493#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 490#L86 assume !(0 != main_~p1~0); 491#L86-2 assume !(0 != main_~p2~0); 557#L90-1 assume !(0 != main_~p3~0); 556#L94-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 555#L98-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 554#L102-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 553#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 552#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 551#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 550#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 549#L122-1 assume !(0 != main_~p11~0); 548#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 547#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 546#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 545#L138-1 assume !(0 != main_~p1~0); 544#L144-1 assume !(0 != main_~p2~0); 542#L149-1 assume !(0 != main_~p3~0); 538#L154-1 assume !(0 != main_~p4~0); 534#L159-1 assume !(0 != main_~p5~0); 530#L164-1 assume !(0 != main_~p6~0); 526#L169-1 assume !(0 != main_~p7~0); 522#L174-1 assume !(0 != main_~p8~0); 518#L179-1 assume !(0 != main_~p9~0); 513#L184-1 assume !(0 != main_~p10~0); 510#L189-1 assume !(0 != main_~p11~0); 506#L194-1 assume !(0 != main_~p12~0); 501#L199-1 assume !(0 != main_~p13~0); 498#L204-1 assume !(0 != main_~p14~0); 478#L209-1 [2019-11-28 20:39:20,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:20,294 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-28 20:39:20,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:20,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858540433] [2019-11-28 20:39:20,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:20,308 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:20,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:20,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1335002329, now seen corresponding path program 1 times [2019-11-28 20:39:20,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:20,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870587511] [2019-11-28 20:39:20,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:20,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870587511] [2019-11-28 20:39:20,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:20,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:20,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477672056] [2019-11-28 20:39:20,357 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:20,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:20,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:20,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:20,359 INFO L87 Difference]: Start difference. First operand 173 states and 277 transitions. cyclomatic complexity: 108 Second operand 3 states. [2019-11-28 20:39:20,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:20,405 INFO L93 Difference]: Finished difference Result 341 states and 541 transitions. [2019-11-28 20:39:20,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:20,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 541 transitions. [2019-11-28 20:39:20,413 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2019-11-28 20:39:20,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 341 states and 541 transitions. [2019-11-28 20:39:20,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2019-11-28 20:39:20,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 341 [2019-11-28 20:39:20,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 341 states and 541 transitions. [2019-11-28 20:39:20,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:20,431 INFO L688 BuchiCegarLoop]: Abstraction has 341 states and 541 transitions. [2019-11-28 20:39:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states and 541 transitions. [2019-11-28 20:39:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2019-11-28 20:39:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-11-28 20:39:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 541 transitions. [2019-11-28 20:39:20,459 INFO L711 BuchiCegarLoop]: Abstraction has 341 states and 541 transitions. [2019-11-28 20:39:20,459 INFO L591 BuchiCegarLoop]: Abstraction has 341 states and 541 transitions. [2019-11-28 20:39:20,459 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:39:20,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 341 states and 541 transitions. [2019-11-28 20:39:20,462 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2019-11-28 20:39:20,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:20,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:20,463 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:20,464 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 20:39:20,464 INFO L794 eck$LassoCheckResult]: Stem: 992#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 993#L209-1 [2019-11-28 20:39:20,464 INFO L796 eck$LassoCheckResult]: Loop: 993#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 1040#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 1037#L86 assume !(0 != main_~p1~0); 1033#L86-2 assume !(0 != main_~p2~0); 1030#L90-1 assume !(0 != main_~p3~0); 1027#L94-1 assume !(0 != main_~p4~0); 1028#L98-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1022#L102-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1023#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1018#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1019#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1014#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1015#L122-1 assume !(0 != main_~p11~0); 1010#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1011#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1006#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1007#L138-1 assume !(0 != main_~p1~0); 1089#L144-1 assume !(0 != main_~p2~0); 1086#L149-1 assume !(0 != main_~p3~0); 1083#L154-1 assume !(0 != main_~p4~0); 1081#L159-1 assume !(0 != main_~p5~0); 1077#L164-1 assume !(0 != main_~p6~0); 1073#L169-1 assume !(0 != main_~p7~0); 1069#L174-1 assume !(0 != main_~p8~0); 1065#L179-1 assume !(0 != main_~p9~0); 1060#L184-1 assume !(0 != main_~p10~0); 1057#L189-1 assume !(0 != main_~p11~0); 1053#L194-1 assume !(0 != main_~p12~0); 1048#L199-1 assume !(0 != main_~p13~0); 1045#L204-1 assume !(0 != main_~p14~0); 993#L209-1 [2019-11-28 20:39:20,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:20,465 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-28 20:39:20,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:20,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470609762] [2019-11-28 20:39:20,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:20,478 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:20,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1475550939, now seen corresponding path program 1 times [2019-11-28 20:39:20,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:20,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255751506] [2019-11-28 20:39:20,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:20,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255751506] [2019-11-28 20:39:20,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:20,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:20,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8428438] [2019-11-28 20:39:20,537 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:20,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:20,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:20,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:20,538 INFO L87 Difference]: Start difference. First operand 341 states and 541 transitions. cyclomatic complexity: 208 Second operand 3 states. [2019-11-28 20:39:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:20,568 INFO L93 Difference]: Finished difference Result 673 states and 1057 transitions. [2019-11-28 20:39:20,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:20,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 673 states and 1057 transitions. [2019-11-28 20:39:20,579 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2019-11-28 20:39:20,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 673 states to 673 states and 1057 transitions. [2019-11-28 20:39:20,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 673 [2019-11-28 20:39:20,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 673 [2019-11-28 20:39:20,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 673 states and 1057 transitions. [2019-11-28 20:39:20,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:20,594 INFO L688 BuchiCegarLoop]: Abstraction has 673 states and 1057 transitions. [2019-11-28 20:39:20,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states and 1057 transitions. [2019-11-28 20:39:20,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2019-11-28 20:39:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-11-28 20:39:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1057 transitions. [2019-11-28 20:39:20,636 INFO L711 BuchiCegarLoop]: Abstraction has 673 states and 1057 transitions. [2019-11-28 20:39:20,636 INFO L591 BuchiCegarLoop]: Abstraction has 673 states and 1057 transitions. [2019-11-28 20:39:20,636 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:39:20,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 673 states and 1057 transitions. [2019-11-28 20:39:20,642 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2019-11-28 20:39:20,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:20,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:20,645 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:20,645 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 20:39:20,646 INFO L794 eck$LassoCheckResult]: Stem: 2015#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 2016#L209-1 [2019-11-28 20:39:20,646 INFO L796 eck$LassoCheckResult]: Loop: 2016#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 2081#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 2079#L86 assume !(0 != main_~p1~0); 2075#L86-2 assume !(0 != main_~p2~0); 2073#L90-1 assume !(0 != main_~p3~0); 2069#L94-1 assume !(0 != main_~p4~0); 2065#L98-1 assume !(0 != main_~p5~0); 2063#L102-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2061#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2059#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2057#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2055#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2053#L122-1 assume !(0 != main_~p11~0); 2051#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2049#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2047#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2044#L138-1 assume !(0 != main_~p1~0); 2045#L144-1 assume !(0 != main_~p2~0); 2129#L149-1 assume !(0 != main_~p3~0); 2124#L154-1 assume !(0 != main_~p4~0); 2120#L159-1 assume !(0 != main_~p5~0); 2117#L164-1 assume !(0 != main_~p6~0); 2113#L169-1 assume !(0 != main_~p7~0); 2109#L174-1 assume !(0 != main_~p8~0); 2105#L179-1 assume !(0 != main_~p9~0); 2100#L184-1 assume !(0 != main_~p10~0); 2097#L189-1 assume !(0 != main_~p11~0); 2093#L194-1 assume !(0 != main_~p12~0); 2088#L199-1 assume !(0 != main_~p13~0); 2085#L204-1 assume !(0 != main_~p14~0); 2016#L209-1 [2019-11-28 20:39:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-28 20:39:20,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:20,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554575127] [2019-11-28 20:39:20,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:20,668 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:20,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:20,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1341537433, now seen corresponding path program 1 times [2019-11-28 20:39:20,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:20,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975551857] [2019-11-28 20:39:20,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:20,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975551857] [2019-11-28 20:39:20,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:20,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:20,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722602405] [2019-11-28 20:39:20,711 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:20,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:20,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:20,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:20,712 INFO L87 Difference]: Start difference. First operand 673 states and 1057 transitions. cyclomatic complexity: 400 Second operand 3 states. [2019-11-28 20:39:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:20,746 INFO L93 Difference]: Finished difference Result 1329 states and 2065 transitions. [2019-11-28 20:39:20,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:20,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1329 states and 2065 transitions. [2019-11-28 20:39:20,761 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2019-11-28 20:39:20,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1329 states to 1329 states and 2065 transitions. [2019-11-28 20:39:20,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1329 [2019-11-28 20:39:20,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1329 [2019-11-28 20:39:20,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1329 states and 2065 transitions. [2019-11-28 20:39:20,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:20,777 INFO L688 BuchiCegarLoop]: Abstraction has 1329 states and 2065 transitions. [2019-11-28 20:39:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states and 2065 transitions. [2019-11-28 20:39:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2019-11-28 20:39:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1329 states. [2019-11-28 20:39:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 2065 transitions. [2019-11-28 20:39:20,810 INFO L711 BuchiCegarLoop]: Abstraction has 1329 states and 2065 transitions. [2019-11-28 20:39:20,810 INFO L591 BuchiCegarLoop]: Abstraction has 1329 states and 2065 transitions. [2019-11-28 20:39:20,810 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:39:20,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1329 states and 2065 transitions. [2019-11-28 20:39:20,820 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2019-11-28 20:39:20,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:20,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:20,821 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:20,821 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 20:39:20,822 INFO L794 eck$LassoCheckResult]: Stem: 4024#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 4025#L209-1 [2019-11-28 20:39:20,822 INFO L796 eck$LassoCheckResult]: Loop: 4025#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 4116#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 4112#L86 assume !(0 != main_~p1~0); 4105#L86-2 assume !(0 != main_~p2~0); 4100#L90-1 assume !(0 != main_~p3~0); 4093#L94-1 assume !(0 != main_~p4~0); 4085#L98-1 assume !(0 != main_~p5~0); 4079#L102-1 assume !(0 != main_~p6~0); 4074#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4075#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4068#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4069#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4062#L122-1 assume !(0 != main_~p11~0); 4063#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4056#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4053#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4054#L138-1 assume !(0 != main_~p1~0); 4207#L144-1 assume !(0 != main_~p2~0); 4189#L149-1 assume !(0 != main_~p3~0); 4178#L154-1 assume !(0 != main_~p4~0); 4172#L159-1 assume !(0 != main_~p5~0); 4170#L164-1 assume !(0 != main_~p6~0); 4169#L169-1 assume !(0 != main_~p7~0); 4167#L174-1 assume !(0 != main_~p8~0); 4165#L179-1 assume !(0 != main_~p9~0); 4158#L184-1 assume !(0 != main_~p10~0); 4147#L189-1 assume !(0 != main_~p11~0); 4139#L194-1 assume !(0 != main_~p12~0); 4134#L199-1 assume !(0 != main_~p13~0); 4125#L204-1 assume !(0 != main_~p14~0); 4025#L209-1 [2019-11-28 20:39:20,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:20,822 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-28 20:39:20,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:20,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013496537] [2019-11-28 20:39:20,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:20,833 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:20,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:20,834 INFO L82 PathProgramCache]: Analyzing trace with hash -463900901, now seen corresponding path program 1 times [2019-11-28 20:39:20,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:20,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505326652] [2019-11-28 20:39:20,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:20,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505326652] [2019-11-28 20:39:20,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:20,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:20,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802491776] [2019-11-28 20:39:20,900 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:20,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:20,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:20,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:20,902 INFO L87 Difference]: Start difference. First operand 1329 states and 2065 transitions. cyclomatic complexity: 768 Second operand 3 states. [2019-11-28 20:39:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:20,933 INFO L93 Difference]: Finished difference Result 2625 states and 4033 transitions. [2019-11-28 20:39:20,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:20,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2625 states and 4033 transitions. [2019-11-28 20:39:20,960 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2019-11-28 20:39:20,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2625 states to 2625 states and 4033 transitions. [2019-11-28 20:39:20,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2625 [2019-11-28 20:39:20,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2625 [2019-11-28 20:39:20,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2625 states and 4033 transitions. [2019-11-28 20:39:20,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:20,988 INFO L688 BuchiCegarLoop]: Abstraction has 2625 states and 4033 transitions. [2019-11-28 20:39:20,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states and 4033 transitions. [2019-11-28 20:39:21,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2625. [2019-11-28 20:39:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2625 states. [2019-11-28 20:39:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 4033 transitions. [2019-11-28 20:39:21,049 INFO L711 BuchiCegarLoop]: Abstraction has 2625 states and 4033 transitions. [2019-11-28 20:39:21,049 INFO L591 BuchiCegarLoop]: Abstraction has 2625 states and 4033 transitions. [2019-11-28 20:39:21,049 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:39:21,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2625 states and 4033 transitions. [2019-11-28 20:39:21,065 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2019-11-28 20:39:21,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:21,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:21,067 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:21,067 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 20:39:21,067 INFO L794 eck$LassoCheckResult]: Stem: 7984#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 7985#L209-1 [2019-11-28 20:39:21,068 INFO L796 eck$LassoCheckResult]: Loop: 7985#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 8074#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 8071#L86 assume !(0 != main_~p1~0); 8067#L86-2 assume !(0 != main_~p2~0); 8064#L90-1 assume !(0 != main_~p3~0); 8061#L94-1 assume !(0 != main_~p4~0); 8057#L98-1 assume !(0 != main_~p5~0); 8041#L102-1 assume !(0 != main_~p6~0); 8042#L106-1 assume !(0 != main_~p7~0); 8268#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 8270#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8266#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8262#L122-1 assume !(0 != main_~p11~0); 8258#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8254#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8250#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8245#L138-1 assume !(0 != main_~p1~0); 8246#L144-1 assume !(0 != main_~p2~0); 8347#L149-1 assume !(0 != main_~p3~0); 8342#L154-1 assume !(0 != main_~p4~0); 8339#L159-1 assume !(0 != main_~p5~0); 8337#L164-1 assume !(0 != main_~p6~0); 8334#L169-1 assume !(0 != main_~p7~0); 8330#L174-1 assume !(0 != main_~p8~0); 8326#L179-1 assume !(0 != main_~p9~0); 8322#L184-1 assume !(0 != main_~p10~0); 8321#L189-1 assume !(0 != main_~p11~0); 8147#L194-1 assume !(0 != main_~p12~0); 8081#L199-1 assume !(0 != main_~p13~0); 8079#L204-1 assume !(0 != main_~p14~0); 7985#L209-1 [2019-11-28 20:39:21,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:21,068 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-28 20:39:21,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:21,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992025257] [2019-11-28 20:39:21,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:21,080 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash -245046183, now seen corresponding path program 1 times [2019-11-28 20:39:21,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:21,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068261289] [2019-11-28 20:39:21,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:21,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068261289] [2019-11-28 20:39:21,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:21,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:21,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770856484] [2019-11-28 20:39:21,132 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:21,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:21,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:21,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:21,133 INFO L87 Difference]: Start difference. First operand 2625 states and 4033 transitions. cyclomatic complexity: 1472 Second operand 3 states. [2019-11-28 20:39:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:21,179 INFO L93 Difference]: Finished difference Result 5185 states and 7873 transitions. [2019-11-28 20:39:21,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:21,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5185 states and 7873 transitions. [2019-11-28 20:39:21,229 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2019-11-28 20:39:21,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5185 states to 5185 states and 7873 transitions. [2019-11-28 20:39:21,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5185 [2019-11-28 20:39:21,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5185 [2019-11-28 20:39:21,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5185 states and 7873 transitions. [2019-11-28 20:39:21,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:21,294 INFO L688 BuchiCegarLoop]: Abstraction has 5185 states and 7873 transitions. [2019-11-28 20:39:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states and 7873 transitions. [2019-11-28 20:39:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 5185. [2019-11-28 20:39:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5185 states. [2019-11-28 20:39:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 7873 transitions. [2019-11-28 20:39:21,422 INFO L711 BuchiCegarLoop]: Abstraction has 5185 states and 7873 transitions. [2019-11-28 20:39:21,422 INFO L591 BuchiCegarLoop]: Abstraction has 5185 states and 7873 transitions. [2019-11-28 20:39:21,423 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:39:21,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5185 states and 7873 transitions. [2019-11-28 20:39:21,451 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2019-11-28 20:39:21,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:21,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:21,455 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:21,455 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 20:39:21,457 INFO L794 eck$LassoCheckResult]: Stem: 15803#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 15804#L209-1 [2019-11-28 20:39:21,458 INFO L796 eck$LassoCheckResult]: Loop: 15804#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 15938#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 15934#L86 assume !(0 != main_~p1~0); 15930#L86-2 assume !(0 != main_~p2~0); 15928#L90-1 assume !(0 != main_~p3~0); 15924#L94-1 assume !(0 != main_~p4~0); 15920#L98-1 assume !(0 != main_~p5~0); 15918#L102-1 assume !(0 != main_~p6~0); 15919#L106-1 assume !(0 != main_~p7~0); 16254#L110-1 assume !(0 != main_~p8~0); 16253#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 16214#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 16211#L122-1 assume !(0 != main_~p11~0); 16208#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 16192#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 16184#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 16176#L138-1 assume !(0 != main_~p1~0); 16169#L144-1 assume !(0 != main_~p2~0); 16160#L149-1 assume !(0 != main_~p3~0); 16157#L154-1 assume !(0 != main_~p4~0); 16153#L159-1 assume !(0 != main_~p5~0); 16145#L164-1 assume !(0 != main_~p6~0); 16086#L169-1 assume !(0 != main_~p7~0); 16082#L174-1 assume !(0 != main_~p8~0); 16079#L179-1 assume !(0 != main_~p9~0); 16076#L184-1 assume !(0 != main_~p10~0); 16075#L189-1 assume !(0 != main_~p11~0); 16071#L194-1 assume !(0 != main_~p12~0); 16068#L199-1 assume !(0 != main_~p13~0); 15942#L204-1 assume !(0 != main_~p14~0); 15804#L209-1 [2019-11-28 20:39:21,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:21,458 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-28 20:39:21,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:21,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346276399] [2019-11-28 20:39:21,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:21,476 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:21,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:21,477 INFO L82 PathProgramCache]: Analyzing trace with hash 177655643, now seen corresponding path program 1 times [2019-11-28 20:39:21,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:21,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153065093] [2019-11-28 20:39:21,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:21,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153065093] [2019-11-28 20:39:21,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:21,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:21,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119077933] [2019-11-28 20:39:21,519 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:21,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:21,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:21,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:21,520 INFO L87 Difference]: Start difference. First operand 5185 states and 7873 transitions. cyclomatic complexity: 2816 Second operand 3 states. [2019-11-28 20:39:21,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:21,575 INFO L93 Difference]: Finished difference Result 10241 states and 15361 transitions. [2019-11-28 20:39:21,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:21,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10241 states and 15361 transitions. [2019-11-28 20:39:21,643 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2019-11-28 20:39:21,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10241 states to 10241 states and 15361 transitions. [2019-11-28 20:39:21,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10241 [2019-11-28 20:39:21,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10241 [2019-11-28 20:39:21,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10241 states and 15361 transitions. [2019-11-28 20:39:21,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:21,738 INFO L688 BuchiCegarLoop]: Abstraction has 10241 states and 15361 transitions. [2019-11-28 20:39:21,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10241 states and 15361 transitions. [2019-11-28 20:39:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10241 to 10241. [2019-11-28 20:39:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10241 states. [2019-11-28 20:39:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10241 states to 10241 states and 15361 transitions. [2019-11-28 20:39:22,044 INFO L711 BuchiCegarLoop]: Abstraction has 10241 states and 15361 transitions. [2019-11-28 20:39:22,044 INFO L591 BuchiCegarLoop]: Abstraction has 10241 states and 15361 transitions. [2019-11-28 20:39:22,044 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 20:39:22,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10241 states and 15361 transitions. [2019-11-28 20:39:22,084 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2019-11-28 20:39:22,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:22,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:22,085 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:22,085 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 20:39:22,086 INFO L794 eck$LassoCheckResult]: Stem: 31233#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 31234#L209-1 [2019-11-28 20:39:22,086 INFO L796 eck$LassoCheckResult]: Loop: 31234#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 31544#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 31545#L86 assume !(0 != main_~p1~0); 31719#L86-2 assume !(0 != main_~p2~0); 31714#L90-1 assume !(0 != main_~p3~0); 31707#L94-1 assume !(0 != main_~p4~0); 31696#L98-1 assume !(0 != main_~p5~0); 31687#L102-1 assume !(0 != main_~p6~0); 31677#L106-1 assume !(0 != main_~p7~0); 31679#L110-1 assume !(0 != main_~p8~0); 31665#L114-1 assume !(0 != main_~p9~0); 31667#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 31645#L122-1 assume !(0 != main_~p11~0); 31646#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 31623#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 31624#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 31609#L138-1 assume !(0 != main_~p1~0); 31610#L144-1 assume !(0 != main_~p2~0); 31818#L149-1 assume !(0 != main_~p3~0); 31814#L154-1 assume !(0 != main_~p4~0); 31579#L159-1 assume !(0 != main_~p5~0); 31581#L164-1 assume !(0 != main_~p6~0); 31745#L169-1 assume !(0 != main_~p7~0); 31744#L174-1 assume !(0 != main_~p8~0); 31743#L179-1 assume !(0 != main_~p9~0); 31741#L184-1 assume !(0 != main_~p10~0); 31740#L189-1 assume !(0 != main_~p11~0); 31737#L194-1 assume !(0 != main_~p12~0); 31729#L199-1 assume !(0 != main_~p13~0); 31554#L204-1 assume !(0 != main_~p14~0); 31234#L209-1 [2019-11-28 20:39:22,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:22,087 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-28 20:39:22,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:22,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661826965] [2019-11-28 20:39:22,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:22,095 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:22,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:22,095 INFO L82 PathProgramCache]: Analyzing trace with hash -639992807, now seen corresponding path program 1 times [2019-11-28 20:39:22,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:22,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365600076] [2019-11-28 20:39:22,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:22,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365600076] [2019-11-28 20:39:22,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:22,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:22,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22849149] [2019-11-28 20:39:22,120 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:22,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:22,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:22,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:22,121 INFO L87 Difference]: Start difference. First operand 10241 states and 15361 transitions. cyclomatic complexity: 5376 Second operand 3 states. [2019-11-28 20:39:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:22,181 INFO L93 Difference]: Finished difference Result 20225 states and 29953 transitions. [2019-11-28 20:39:22,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:22,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20225 states and 29953 transitions. [2019-11-28 20:39:22,282 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2019-11-28 20:39:22,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20225 states to 20225 states and 29953 transitions. [2019-11-28 20:39:22,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20225 [2019-11-28 20:39:22,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20225 [2019-11-28 20:39:22,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20225 states and 29953 transitions. [2019-11-28 20:39:22,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:22,403 INFO L688 BuchiCegarLoop]: Abstraction has 20225 states and 29953 transitions. [2019-11-28 20:39:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20225 states and 29953 transitions. [2019-11-28 20:39:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20225 to 20225. [2019-11-28 20:39:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-11-28 20:39:22,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 29953 transitions. [2019-11-28 20:39:22,713 INFO L711 BuchiCegarLoop]: Abstraction has 20225 states and 29953 transitions. [2019-11-28 20:39:22,713 INFO L591 BuchiCegarLoop]: Abstraction has 20225 states and 29953 transitions. [2019-11-28 20:39:22,713 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 20:39:22,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20225 states and 29953 transitions. [2019-11-28 20:39:22,775 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2019-11-28 20:39:22,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:22,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:22,776 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:22,776 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 20:39:22,776 INFO L794 eck$LassoCheckResult]: Stem: 61703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 61704#L209-1 [2019-11-28 20:39:22,776 INFO L796 eck$LassoCheckResult]: Loop: 61704#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 61843#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 61839#L86 assume !(0 != main_~p1~0); 61832#L86-2 assume !(0 != main_~p2~0); 61827#L90-1 assume !(0 != main_~p3~0); 61820#L94-1 assume !(0 != main_~p4~0); 61812#L98-1 assume !(0 != main_~p5~0); 61804#L102-1 assume !(0 != main_~p6~0); 61796#L106-1 assume !(0 != main_~p7~0); 61788#L110-1 assume !(0 != main_~p8~0); 61780#L114-1 assume !(0 != main_~p9~0); 61774#L118-1 assume !(0 != main_~p10~0); 61768#L122-1 assume !(0 != main_~p11~0); 61769#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 61760#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 61761#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 61933#L138-1 assume !(0 != main_~p1~0); 61925#L144-1 assume !(0 != main_~p2~0); 61918#L149-1 assume !(0 != main_~p3~0); 61909#L154-1 assume !(0 != main_~p4~0); 61901#L159-1 assume !(0 != main_~p5~0); 61896#L164-1 assume !(0 != main_~p6~0); 61890#L169-1 assume !(0 != main_~p7~0); 61884#L174-1 assume !(0 != main_~p8~0); 61879#L179-1 assume !(0 != main_~p9~0); 61877#L184-1 assume !(0 != main_~p10~0); 61868#L189-1 assume !(0 != main_~p11~0); 61860#L194-1 assume !(0 != main_~p12~0); 61855#L199-1 assume !(0 != main_~p13~0); 61852#L204-1 assume !(0 != main_~p14~0); 61704#L209-1 [2019-11-28 20:39:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:22,777 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-11-28 20:39:22,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:22,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938037405] [2019-11-28 20:39:22,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:22,791 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:22,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1966030747, now seen corresponding path program 1 times [2019-11-28 20:39:22,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:22,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746378091] [2019-11-28 20:39:22,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:22,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746378091] [2019-11-28 20:39:22,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:22,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:22,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77419774] [2019-11-28 20:39:22,821 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:22,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:22,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:22,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:22,822 INFO L87 Difference]: Start difference. First operand 20225 states and 29953 transitions. cyclomatic complexity: 10240 Second operand 3 states. [2019-11-28 20:39:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:22,934 INFO L93 Difference]: Finished difference Result 39937 states and 58369 transitions. [2019-11-28 20:39:22,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:22,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39937 states and 58369 transitions. [2019-11-28 20:39:23,132 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2019-11-28 20:39:23,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39937 states to 39937 states and 58369 transitions. [2019-11-28 20:39:23,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39937 [2019-11-28 20:39:23,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39937 [2019-11-28 20:39:23,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39937 states and 58369 transitions. [2019-11-28 20:39:23,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:23,410 INFO L688 BuchiCegarLoop]: Abstraction has 39937 states and 58369 transitions. [2019-11-28 20:39:23,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39937 states and 58369 transitions. [2019-11-28 20:39:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39937 to 39937. [2019-11-28 20:39:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39937 states. [2019-11-28 20:39:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39937 states to 39937 states and 58369 transitions. [2019-11-28 20:39:24,213 INFO L711 BuchiCegarLoop]: Abstraction has 39937 states and 58369 transitions. [2019-11-28 20:39:24,214 INFO L591 BuchiCegarLoop]: Abstraction has 39937 states and 58369 transitions. [2019-11-28 20:39:24,214 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 20:39:24,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39937 states and 58369 transitions. [2019-11-28 20:39:24,328 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2019-11-28 20:39:24,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:24,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:24,329 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:24,329 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 20:39:24,329 INFO L794 eck$LassoCheckResult]: Stem: 121875#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 121876#L209-1 [2019-11-28 20:39:24,330 INFO L796 eck$LassoCheckResult]: Loop: 121876#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 122049#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 122046#L86 assume !(0 != main_~p1~0); 122043#L86-2 assume !(0 != main_~p2~0); 122041#L90-1 assume !(0 != main_~p3~0); 122037#L94-1 assume !(0 != main_~p4~0); 122033#L98-1 assume !(0 != main_~p5~0); 122029#L102-1 assume !(0 != main_~p6~0); 122025#L106-1 assume !(0 != main_~p7~0); 122021#L110-1 assume !(0 != main_~p8~0); 122017#L114-1 assume !(0 != main_~p9~0); 121959#L118-1 assume !(0 != main_~p10~0); 121948#L122-1 assume !(0 != main_~p11~0); 121949#L126-1 assume !(0 != main_~p12~0); 122163#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 122160#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 122157#L138-1 assume !(0 != main_~p1~0); 122158#L144-1 assume !(0 != main_~p2~0); 122270#L149-1 assume !(0 != main_~p3~0); 122261#L154-1 assume !(0 != main_~p4~0); 122256#L159-1 assume !(0 != main_~p5~0); 122250#L164-1 assume !(0 != main_~p6~0); 122244#L169-1 assume !(0 != main_~p7~0); 122239#L174-1 assume !(0 != main_~p8~0); 122223#L179-1 assume !(0 != main_~p9~0); 122070#L184-1 assume !(0 != main_~p10~0); 122067#L189-1 assume !(0 != main_~p11~0); 122062#L194-1 assume !(0 != main_~p12~0); 122056#L199-1 assume !(0 != main_~p13~0); 122053#L204-1 assume !(0 != main_~p14~0); 121876#L209-1 [2019-11-28 20:39:24,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:24,330 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 11 times [2019-11-28 20:39:24,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:24,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97810385] [2019-11-28 20:39:24,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:24,338 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:24,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:24,339 INFO L82 PathProgramCache]: Analyzing trace with hash 377682845, now seen corresponding path program 1 times [2019-11-28 20:39:24,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:24,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166504351] [2019-11-28 20:39:24,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:24,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166504351] [2019-11-28 20:39:24,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:24,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:24,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063621890] [2019-11-28 20:39:24,361 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:24,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:24,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:24,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:24,362 INFO L87 Difference]: Start difference. First operand 39937 states and 58369 transitions. cyclomatic complexity: 19456 Second operand 3 states. [2019-11-28 20:39:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:24,544 INFO L93 Difference]: Finished difference Result 78849 states and 113665 transitions. [2019-11-28 20:39:24,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:24,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78849 states and 113665 transitions. [2019-11-28 20:39:24,860 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2019-11-28 20:39:25,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78849 states to 78849 states and 113665 transitions. [2019-11-28 20:39:25,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78849 [2019-11-28 20:39:25,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78849 [2019-11-28 20:39:25,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78849 states and 113665 transitions. [2019-11-28 20:39:25,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:25,695 INFO L688 BuchiCegarLoop]: Abstraction has 78849 states and 113665 transitions. [2019-11-28 20:39:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78849 states and 113665 transitions. [2019-11-28 20:39:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78849 to 78849. [2019-11-28 20:39:26,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78849 states. [2019-11-28 20:39:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78849 states to 78849 states and 113665 transitions. [2019-11-28 20:39:26,484 INFO L711 BuchiCegarLoop]: Abstraction has 78849 states and 113665 transitions. [2019-11-28 20:39:26,484 INFO L591 BuchiCegarLoop]: Abstraction has 78849 states and 113665 transitions. [2019-11-28 20:39:26,484 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 20:39:26,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78849 states and 113665 transitions. [2019-11-28 20:39:27,075 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2019-11-28 20:39:27,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:27,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:27,076 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:27,077 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 20:39:27,077 INFO L794 eck$LassoCheckResult]: Stem: 240666#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 240667#L209-1 [2019-11-28 20:39:27,077 INFO L796 eck$LassoCheckResult]: Loop: 240667#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 240974#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 240970#L86 assume !(0 != main_~p1~0); 240967#L86-2 assume !(0 != main_~p2~0); 240914#L90-1 assume !(0 != main_~p3~0); 240915#L94-1 assume !(0 != main_~p4~0); 240896#L98-1 assume !(0 != main_~p5~0); 240897#L102-1 assume !(0 != main_~p6~0); 240877#L106-1 assume !(0 != main_~p7~0); 240879#L110-1 assume !(0 != main_~p8~0); 240853#L114-1 assume !(0 != main_~p9~0); 240855#L118-1 assume !(0 != main_~p10~0); 240832#L122-1 assume !(0 != main_~p11~0); 240833#L126-1 assume !(0 != main_~p12~0); 240809#L130-1 assume !(0 != main_~p13~0); 240811#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 240789#L138-1 assume !(0 != main_~p1~0); 240791#L144-1 assume !(0 != main_~p2~0); 241018#L149-1 assume !(0 != main_~p3~0); 241013#L154-1 assume !(0 != main_~p4~0); 241010#L159-1 assume !(0 != main_~p5~0); 241008#L164-1 assume !(0 != main_~p6~0); 241005#L169-1 assume !(0 != main_~p7~0); 241001#L174-1 assume !(0 != main_~p8~0); 240997#L179-1 assume !(0 != main_~p9~0); 240993#L184-1 assume !(0 != main_~p10~0); 240990#L189-1 assume !(0 != main_~p11~0); 240985#L194-1 assume !(0 != main_~p12~0); 240981#L199-1 assume !(0 != main_~p13~0); 240978#L204-1 assume !(0 != main_~p14~0); 240667#L209-1 [2019-11-28 20:39:27,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:27,078 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 12 times [2019-11-28 20:39:27,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:27,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920068606] [2019-11-28 20:39:27,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:27,084 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:27,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:27,085 INFO L82 PathProgramCache]: Analyzing trace with hash -643385509, now seen corresponding path program 1 times [2019-11-28 20:39:27,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:27,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323440519] [2019-11-28 20:39:27,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:27,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323440519] [2019-11-28 20:39:27,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:27,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:39:27,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255387227] [2019-11-28 20:39:27,113 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:27,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:27,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:27,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:27,114 INFO L87 Difference]: Start difference. First operand 78849 states and 113665 transitions. cyclomatic complexity: 36864 Second operand 3 states. [2019-11-28 20:39:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:27,401 INFO L93 Difference]: Finished difference Result 155649 states and 221185 transitions. [2019-11-28 20:39:27,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:27,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155649 states and 221185 transitions. [2019-11-28 20:39:27,917 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2019-11-28 20:39:28,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155649 states to 155649 states and 221185 transitions. [2019-11-28 20:39:28,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155649 [2019-11-28 20:39:28,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155649 [2019-11-28 20:39:28,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155649 states and 221185 transitions. [2019-11-28 20:39:28,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:28,441 INFO L688 BuchiCegarLoop]: Abstraction has 155649 states and 221185 transitions. [2019-11-28 20:39:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155649 states and 221185 transitions. [2019-11-28 20:39:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155649 to 155649. [2019-11-28 20:39:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155649 states. [2019-11-28 20:39:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155649 states to 155649 states and 221185 transitions. [2019-11-28 20:39:30,899 INFO L711 BuchiCegarLoop]: Abstraction has 155649 states and 221185 transitions. [2019-11-28 20:39:30,899 INFO L591 BuchiCegarLoop]: Abstraction has 155649 states and 221185 transitions. [2019-11-28 20:39:30,899 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 20:39:30,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155649 states and 221185 transitions. [2019-11-28 20:39:31,258 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2019-11-28 20:39:31,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:31,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:31,260 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:31,260 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 20:39:31,260 INFO L794 eck$LassoCheckResult]: Stem: 475170#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 475171#L209-1 [2019-11-28 20:39:31,261 INFO L796 eck$LassoCheckResult]: Loop: 475171#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 475767#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 475763#L86 assume !(0 != main_~p1~0); 475759#L86-2 assume !(0 != main_~p2~0); 475756#L90-1 assume !(0 != main_~p3~0); 475754#L94-1 assume !(0 != main_~p4~0); 475752#L98-1 assume !(0 != main_~p5~0); 475749#L102-1 assume !(0 != main_~p6~0); 475742#L106-1 assume !(0 != main_~p7~0); 475743#L110-1 assume !(0 != main_~p8~0); 475747#L114-1 assume !(0 != main_~p9~0); 475745#L118-1 assume !(0 != main_~p10~0); 475744#L122-1 assume !(0 != main_~p11~0); 475700#L126-1 assume !(0 != main_~p12~0); 475696#L130-1 assume !(0 != main_~p13~0); 475692#L134-1 assume !(0 != main_~p14~0); 475689#L138-1 assume !(0 != main_~p1~0); 475679#L144-1 assume !(0 != main_~p2~0); 475681#L149-1 assume !(0 != main_~p3~0); 475803#L154-1 assume !(0 != main_~p4~0); 475801#L159-1 assume !(0 != main_~p5~0); 475797#L164-1 assume !(0 != main_~p6~0); 475794#L169-1 assume !(0 != main_~p7~0); 475790#L174-1 assume !(0 != main_~p8~0); 475786#L179-1 assume !(0 != main_~p9~0); 475783#L184-1 assume !(0 != main_~p10~0); 475781#L189-1 assume !(0 != main_~p11~0); 475777#L194-1 assume !(0 != main_~p12~0); 475774#L199-1 assume !(0 != main_~p13~0); 475771#L204-1 assume !(0 != main_~p14~0); 475171#L209-1 [2019-11-28 20:39:31,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:31,261 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 13 times [2019-11-28 20:39:31,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:31,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367584078] [2019-11-28 20:39:31,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,268 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:31,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:31,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1923249187, now seen corresponding path program 1 times [2019-11-28 20:39:31,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:31,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053181804] [2019-11-28 20:39:31,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,285 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:31,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:31,286 INFO L82 PathProgramCache]: Analyzing trace with hash 361614268, now seen corresponding path program 1 times [2019-11-28 20:39:31,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:31,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618062854] [2019-11-28 20:39:31,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,301 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:31,410 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-28 20:39:32,696 WARN L192 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-28 20:39:32,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:39:32 BoogieIcfgContainer [2019-11-28 20:39:32,764 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:39:32,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:39:32,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:39:32,765 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:39:32,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:19" (3/4) ... [2019-11-28 20:39:32,769 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 20:39:32,833 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:39:32,834 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:39:32,836 INFO L168 Benchmark]: Toolchain (without parser) took 14056.09 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 960.4 MB in the beginning and 1.6 GB in the end (delta: -685.3 MB). Peak memory consumption was 940.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:32,836 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:39:32,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:32,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:39:32,838 INFO L168 Benchmark]: Boogie Preprocessor took 28.80 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:32,839 INFO L168 Benchmark]: RCFGBuilder took 439.79 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:32,840 INFO L168 Benchmark]: BuchiAutomizer took 13123.59 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -560.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-28 20:39:32,840 INFO L168 Benchmark]: Witness Printer took 69.10 ms. Allocated memory is still 2.7 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:39:32,843 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.80 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 439.79 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13123.59 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -560.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 69.10 ms. Allocated memory is still 2.7 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (12 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.12 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 155649 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.0s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 0. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 4.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 2.8s Buchi closure took 0.2s. Biggest automaton had 155649 states and ocurred in iteration 12. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1312 SDtfs, 690 SDslu, 821 SDs, 0 SdLazy, 60 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI12 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 51]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c4afd17=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b4f4b72=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@290467d5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f4b41c=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79c9df6b=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79bc20f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62cc10ae=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3255c892=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fbdeaa8=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e0e2980=0, p14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@656fce22=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e3c7205=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63100171=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6920f809=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7103d642=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 51]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L49] int cond; Loop: [L51] COND TRUE 1 [L52] cond = __VERIFIER_nondet_int() [L53] COND FALSE !(cond == 0) [L56] lk1 = 0 [L58] lk2 = 0 [L60] lk3 = 0 [L62] lk4 = 0 [L64] lk5 = 0 [L66] lk6 = 0 [L68] lk7 = 0 [L70] lk8 = 0 [L72] lk9 = 0 [L74] lk10 = 0 [L76] lk11 = 0 [L78] lk12 = 0 [L80] lk13 = 0 [L82] lk14 = 0 [L86] COND FALSE !(p1 != 0) [L90] COND FALSE !(p2 != 0) [L94] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L102] COND FALSE !(p5 != 0) [L106] COND FALSE !(p6 != 0) [L110] COND FALSE !(p7 != 0) [L114] COND FALSE !(p8 != 0) [L118] COND FALSE !(p9 != 0) [L122] COND FALSE !(p10 != 0) [L126] COND FALSE !(p11 != 0) [L130] COND FALSE !(p12 != 0) [L134] COND FALSE !(p13 != 0) [L138] COND FALSE !(p14 != 0) [L144] COND FALSE !(p1 != 0) [L149] COND FALSE !(p2 != 0) [L154] COND FALSE !(p3 != 0) [L159] COND FALSE !(p4 != 0) [L164] COND FALSE !(p5 != 0) [L169] COND FALSE !(p6 != 0) [L174] COND FALSE !(p7 != 0) [L179] COND FALSE !(p8 != 0) [L184] COND FALSE !(p9 != 0) [L189] COND FALSE !(p10 != 0) [L194] COND FALSE !(p11 != 0) [L199] COND FALSE !(p12 != 0) [L204] COND FALSE !(p13 != 0) [L209] COND FALSE !(p14 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...