./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/bin-2019/uautomizer --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 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-1dbac8b [2018-11-10 06:01:24,918 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:01:24,919 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:01:24,925 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:01:24,925 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:01:24,926 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:01:24,926 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:01:24,928 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:01:24,929 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:01:24,929 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:01:24,930 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:01:24,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:01:24,930 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:01:24,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:01:24,932 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:01:24,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:01:24,933 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:01:24,934 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:01:24,935 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:01:24,936 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:01:24,937 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:01:24,938 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:01:24,939 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:01:24,939 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:01:24,940 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:01:24,940 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:01:24,941 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:01:24,941 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:01:24,942 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:01:24,942 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:01:24,943 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:01:24,943 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:01:24,943 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:01:24,943 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:01:24,943 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:01:24,944 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:01:24,944 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 06:01:24,952 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:01:24,952 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:01:24,953 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:01:24,953 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:01:24,954 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:01:24,954 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 06:01:24,954 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 06:01:24,954 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 06:01:24,954 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 06:01:24,954 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 06:01:24,954 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 06:01:24,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:01:24,955 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:01:24,955 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:01:24,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:01:24,955 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:01:24,955 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:01:24,955 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 06:01:24,955 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 06:01:24,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 06:01:24,956 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:01:24,956 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:01:24,956 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 06:01:24,956 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 06:01:24,956 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:01:24,956 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:01:24,956 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 06:01:24,957 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:01:24,957 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:01:24,957 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 06:01:24,957 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 06:01:24,958 INFO L133 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/bin-2019/uautomizer 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 -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2018-11-10 06:01:24,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:01:24,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:01:24,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:01:24,989 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:01:24,990 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:01:24,990 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 06:01:25,024 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/bin-2019/uautomizer/data/ff4a13346/f0f4fde089384e66a54419a18017a63a/FLAG717d3df8c [2018-11-10 06:01:25,417 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:01:25,418 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 06:01:25,422 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/bin-2019/uautomizer/data/ff4a13346/f0f4fde089384e66a54419a18017a63a/FLAG717d3df8c [2018-11-10 06:01:25,432 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/bin-2019/uautomizer/data/ff4a13346/f0f4fde089384e66a54419a18017a63a [2018-11-10 06:01:25,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:01:25,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:01:25,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:01:25,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:01:25,439 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:01:25,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:01:25" (1/1) ... [2018-11-10 06:01:25,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:25, skipping insertion in model container [2018-11-10 06:01:25,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:01:25" (1/1) ... [2018-11-10 06:01:25,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:01:25,461 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:01:25,560 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:01:25,562 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:01:25,577 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:01:25,585 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:01:25,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:25 WrapperNode [2018-11-10 06:01:25,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:01:25,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:01:25,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:01:25,586 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:01:25,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:25" (1/1) ... [2018-11-10 06:01:25,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:25" (1/1) ... [2018-11-10 06:01:25,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:01:25,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:01:25,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:01:25,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:01:25,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:25" (1/1) ... [2018-11-10 06:01:25,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:25" (1/1) ... [2018-11-10 06:01:25,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:25" (1/1) ... [2018-11-10 06:01:25,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:25" (1/1) ... [2018-11-10 06:01:25,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:25" (1/1) ... [2018-11-10 06:01:25,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:25" (1/1) ... [2018-11-10 06:01:25,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:25" (1/1) ... [2018-11-10 06:01:25,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:01:25,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:01:25,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:01:25,625 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:01:25,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/bin-2019/uautomizer/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 [2018-11-10 06:01:25,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:01:25,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:01:25,886 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:01:25,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:01:25 BoogieIcfgContainer [2018-11-10 06:01:25,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:01:25,886 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 06:01:25,886 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 06:01:25,889 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 06:01:25,890 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:01:25,890 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 06:01:25" (1/3) ... [2018-11-10 06:01:25,891 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10ad1dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:01:25, skipping insertion in model container [2018-11-10 06:01:25,891 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:01:25,891 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:25" (2/3) ... [2018-11-10 06:01:25,891 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10ad1dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:01:25, skipping insertion in model container [2018-11-10 06:01:25,891 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:01:25,892 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:01:25" (3/3) ... [2018-11-10 06:01:25,893 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 06:01:25,941 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:01:25,941 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 06:01:25,942 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 06:01:25,942 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 06:01:25,942 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:01:25,942 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:01:25,942 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 06:01:25,942 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:01:25,942 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 06:01:25,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2018-11-10 06:01:25,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 06:01:25,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:25,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:25,981 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:01:25,981 INFO L867 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] [2018-11-10 06:01:25,982 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 06:01:25,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2018-11-10 06:01:25,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 06:01:25,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:25,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:25,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:01:25,985 INFO L867 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] [2018-11-10 06:01:25,992 INFO L793 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 15#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 14#L181-1true [2018-11-10 06:01:25,993 INFO L795 eck$LassoCheckResult]: Loop: 14#L181-1true assume true; 23#L45-1true assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 3#L47true assume !(main_~cond~0 == 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; 24#L76true assume main_~p1~0 != 0;main_~lk1~0 := 1; 18#L76-2true assume main_~p2~0 != 0;main_~lk2~0 := 1; 4#L80-1true assume main_~p3~0 != 0;main_~lk3~0 := 1; 11#L84-1true assume main_~p4~0 != 0;main_~lk4~0 := 1; 46#L88-1true assume main_~p5~0 != 0;main_~lk5~0 := 1; 35#L92-1true assume main_~p6~0 != 0;main_~lk6~0 := 1; 16#L96-1true assume main_~p7~0 != 0;main_~lk7~0 := 1; 30#L100-1true assume !(main_~p8~0 != 0); 8#L104-1true assume main_~p9~0 != 0;main_~lk9~0 := 1; 43#L108-1true assume main_~p10~0 != 0;main_~lk10~0 := 1; 32#L112-1true assume main_~p11~0 != 0;main_~lk11~0 := 1; 39#L116-1true assume main_~p12~0 != 0;main_~lk12~0 := 1; 26#L120-1true assume !(main_~p1~0 != 0); 9#L126-1true assume !(main_~p2~0 != 0); 27#L131-1true assume !(main_~p3~0 != 0); 37#L136-1true assume !(main_~p4~0 != 0); 44#L141-1true assume !(main_~p5~0 != 0); 6#L146-1true assume !(main_~p6~0 != 0); 21#L151-1true assume !(main_~p7~0 != 0); 36#L156-1true assume !(main_~p8~0 != 0); 42#L161-1true assume !(main_~p9~0 != 0); 5#L166-1true assume !(main_~p10~0 != 0); 19#L171-1true assume !(main_~p11~0 != 0); 33#L176-1true assume !(main_~p12~0 != 0); 14#L181-1true [2018-11-10 06:01:25,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:25,998 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 06:01:25,999 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:26,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1468030446, now seen corresponding path program 1 times [2018-11-10 06:01:26,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:26,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:26,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:26,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:01:26,137 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:01:26,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:01:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:01:26,148 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-11-10 06:01:26,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:26,183 INFO L93 Difference]: Finished difference Result 89 states and 156 transitions. [2018-11-10 06:01:26,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:01:26,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 156 transitions. [2018-11-10 06:01:26,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 [2018-11-10 06:01:26,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 79 states and 125 transitions. [2018-11-10 06:01:26,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-10 06:01:26,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2018-11-10 06:01:26,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 125 transitions. [2018-11-10 06:01:26,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:26,194 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 125 transitions. [2018-11-10 06:01:26,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 125 transitions. [2018-11-10 06:01:26,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-10 06:01:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 06:01:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 125 transitions. [2018-11-10 06:01:26,216 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 125 transitions. [2018-11-10 06:01:26,216 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 125 transitions. [2018-11-10 06:01:26,216 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 06:01:26,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 125 transitions. [2018-11-10 06:01:26,218 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 [2018-11-10 06:01:26,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:26,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:26,219 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:01:26,219 INFO L867 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] [2018-11-10 06:01:26,219 INFO L793 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 166#L181-1 [2018-11-10 06:01:26,219 INFO L795 eck$LassoCheckResult]: Loop: 166#L181-1 assume true; 167#L45-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 144#L47 assume !(main_~cond~0 == 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; 145#L76 assume !(main_~p1~0 != 0); 189#L76-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 222#L80-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 221#L84-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 220#L88-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 219#L92-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 218#L96-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 217#L100-1 assume !(main_~p8~0 != 0); 216#L104-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 215#L108-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 214#L112-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 213#L116-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 212#L120-1 assume !(main_~p1~0 != 0); 211#L126-1 assume !(main_~p2~0 != 0); 209#L131-1 assume !(main_~p3~0 != 0); 207#L136-1 assume !(main_~p4~0 != 0); 188#L141-1 assume !(main_~p5~0 != 0); 153#L146-1 assume !(main_~p6~0 != 0); 155#L151-1 assume !(main_~p7~0 != 0); 200#L156-1 assume !(main_~p8~0 != 0); 199#L161-1 assume !(main_~p9~0 != 0); 197#L166-1 assume !(main_~p10~0 != 0); 194#L171-1 assume !(main_~p11~0 != 0); 181#L176-1 assume !(main_~p12~0 != 0); 166#L181-1 [2018-11-10 06:01:26,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,219 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 06:01:26,220 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:26,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1602043952, now seen corresponding path program 1 times [2018-11-10 06:01:26,225 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:26,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:26,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:26,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:01:26,255 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:01:26,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:01:26,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:01:26,256 INFO L87 Difference]: Start difference. First operand 79 states and 125 transitions. cyclomatic complexity: 48 Second operand 3 states. [2018-11-10 06:01:26,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:26,277 INFO L93 Difference]: Finished difference Result 154 states and 242 transitions. [2018-11-10 06:01:26,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:01:26,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 242 transitions. [2018-11-10 06:01:26,280 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 152 [2018-11-10 06:01:26,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 242 transitions. [2018-11-10 06:01:26,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2018-11-10 06:01:26,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-10 06:01:26,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 242 transitions. [2018-11-10 06:01:26,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:26,282 INFO L705 BuchiCegarLoop]: Abstraction has 154 states and 242 transitions. [2018-11-10 06:01:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 242 transitions. [2018-11-10 06:01:26,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-11-10 06:01:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-10 06:01:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 242 transitions. [2018-11-10 06:01:26,291 INFO L728 BuchiCegarLoop]: Abstraction has 154 states and 242 transitions. [2018-11-10 06:01:26,292 INFO L608 BuchiCegarLoop]: Abstraction has 154 states and 242 transitions. [2018-11-10 06:01:26,292 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 06:01:26,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 242 transitions. [2018-11-10 06:01:26,293 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 152 [2018-11-10 06:01:26,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:26,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:26,295 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:01:26,295 INFO L867 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] [2018-11-10 06:01:26,295 INFO L793 eck$LassoCheckResult]: Stem: 436#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 411#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 412#L181-1 [2018-11-10 06:01:26,295 INFO L795 eck$LassoCheckResult]: Loop: 412#L181-1 assume true; 472#L45-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 470#L47 assume !(main_~cond~0 == 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; 468#L76 assume !(main_~p1~0 != 0); 465#L76-2 assume !(main_~p2~0 != 0); 463#L80-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 461#L84-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 459#L88-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 457#L92-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 455#L96-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 453#L100-1 assume !(main_~p8~0 != 0); 451#L104-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 449#L108-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 447#L112-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 445#L116-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 443#L120-1 assume !(main_~p1~0 != 0); 444#L126-1 assume !(main_~p2~0 != 0); 510#L131-1 assume !(main_~p3~0 != 0); 506#L136-1 assume !(main_~p4~0 != 0); 502#L141-1 assume !(main_~p5~0 != 0); 498#L146-1 assume !(main_~p6~0 != 0); 494#L151-1 assume !(main_~p7~0 != 0); 489#L156-1 assume !(main_~p8~0 != 0); 486#L161-1 assume !(main_~p9~0 != 0); 484#L166-1 assume !(main_~p10~0 != 0); 479#L171-1 assume !(main_~p11~0 != 0); 476#L176-1 assume !(main_~p12~0 != 0); 412#L181-1 [2018-11-10 06:01:26,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,296 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 06:01:26,296 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:26,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,301 INFO L82 PathProgramCache]: Analyzing trace with hash 887485010, now seen corresponding path program 1 times [2018-11-10 06:01:26,301 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:26,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:26,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:26,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:01:26,335 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:01:26,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:01:26,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:01:26,335 INFO L87 Difference]: Start difference. First operand 154 states and 242 transitions. cyclomatic complexity: 92 Second operand 3 states. [2018-11-10 06:01:26,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:26,376 INFO L93 Difference]: Finished difference Result 302 states and 470 transitions. [2018-11-10 06:01:26,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:01:26,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 302 states and 470 transitions. [2018-11-10 06:01:26,378 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 300 [2018-11-10 06:01:26,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 302 states to 302 states and 470 transitions. [2018-11-10 06:01:26,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2018-11-10 06:01:26,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 302 [2018-11-10 06:01:26,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 470 transitions. [2018-11-10 06:01:26,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:26,382 INFO L705 BuchiCegarLoop]: Abstraction has 302 states and 470 transitions. [2018-11-10 06:01:26,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 470 transitions. [2018-11-10 06:01:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2018-11-10 06:01:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-11-10 06:01:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 470 transitions. [2018-11-10 06:01:26,392 INFO L728 BuchiCegarLoop]: Abstraction has 302 states and 470 transitions. [2018-11-10 06:01:26,392 INFO L608 BuchiCegarLoop]: Abstraction has 302 states and 470 transitions. [2018-11-10 06:01:26,392 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 06:01:26,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 302 states and 470 transitions. [2018-11-10 06:01:26,394 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 300 [2018-11-10 06:01:26,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:26,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:26,395 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:01:26,395 INFO L867 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] [2018-11-10 06:01:26,395 INFO L793 eck$LassoCheckResult]: Stem: 899#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 869#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 870#L181-1 [2018-11-10 06:01:26,395 INFO L795 eck$LassoCheckResult]: Loop: 870#L181-1 assume true; 944#L45-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 942#L47 assume !(main_~cond~0 == 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; 940#L76 assume !(main_~p1~0 != 0); 936#L76-2 assume !(main_~p2~0 != 0); 934#L80-1 assume !(main_~p3~0 != 0); 932#L84-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 930#L88-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 928#L92-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 926#L96-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 924#L100-1 assume !(main_~p8~0 != 0); 922#L104-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 920#L108-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 918#L112-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 916#L116-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 913#L120-1 assume !(main_~p1~0 != 0); 914#L126-1 assume !(main_~p2~0 != 0); 983#L131-1 assume !(main_~p3~0 != 0); 980#L136-1 assume !(main_~p4~0 != 0); 976#L141-1 assume !(main_~p5~0 != 0); 972#L146-1 assume !(main_~p6~0 != 0); 968#L151-1 assume !(main_~p7~0 != 0); 963#L156-1 assume !(main_~p8~0 != 0); 960#L161-1 assume !(main_~p9~0 != 0); 956#L166-1 assume !(main_~p10~0 != 0); 951#L171-1 assume !(main_~p11~0 != 0); 948#L176-1 assume !(main_~p12~0 != 0); 870#L181-1 [2018-11-10 06:01:26,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,396 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 06:01:26,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:26,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1106339728, now seen corresponding path program 1 times [2018-11-10 06:01:26,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:26,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:26,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:26,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:01:26,435 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:01:26,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:01:26,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:01:26,436 INFO L87 Difference]: Start difference. First operand 302 states and 470 transitions. cyclomatic complexity: 176 Second operand 3 states. [2018-11-10 06:01:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:26,454 INFO L93 Difference]: Finished difference Result 594 states and 914 transitions. [2018-11-10 06:01:26,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:01:26,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 594 states and 914 transitions. [2018-11-10 06:01:26,457 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 592 [2018-11-10 06:01:26,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 594 states to 594 states and 914 transitions. [2018-11-10 06:01:26,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 594 [2018-11-10 06:01:26,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 594 [2018-11-10 06:01:26,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 594 states and 914 transitions. [2018-11-10 06:01:26,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:26,462 INFO L705 BuchiCegarLoop]: Abstraction has 594 states and 914 transitions. [2018-11-10 06:01:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states and 914 transitions. [2018-11-10 06:01:26,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2018-11-10 06:01:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-10 06:01:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 914 transitions. [2018-11-10 06:01:26,479 INFO L728 BuchiCegarLoop]: Abstraction has 594 states and 914 transitions. [2018-11-10 06:01:26,479 INFO L608 BuchiCegarLoop]: Abstraction has 594 states and 914 transitions. [2018-11-10 06:01:26,479 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 06:01:26,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 594 states and 914 transitions. [2018-11-10 06:01:26,482 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 592 [2018-11-10 06:01:26,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:26,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:26,483 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:01:26,483 INFO L867 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] [2018-11-10 06:01:26,483 INFO L793 eck$LassoCheckResult]: Stem: 1801#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1770#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 1771#L181-1 [2018-11-10 06:01:26,483 INFO L795 eck$LassoCheckResult]: Loop: 1771#L181-1 assume true; 1881#L45-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 1877#L47 assume !(main_~cond~0 == 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; 1873#L76 assume !(main_~p1~0 != 0); 1866#L76-2 assume !(main_~p2~0 != 0); 1859#L80-1 assume !(main_~p3~0 != 0); 1852#L84-1 assume !(main_~p4~0 != 0); 1853#L88-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 1843#L92-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 1844#L96-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 1835#L100-1 assume !(main_~p8~0 != 0); 1836#L104-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 1827#L108-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 1828#L112-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 1819#L116-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 1820#L120-1 assume !(main_~p1~0 != 0); 1958#L126-1 assume !(main_~p2~0 != 0); 1948#L131-1 assume !(main_~p3~0 != 0); 1945#L136-1 assume !(main_~p4~0 != 0); 1924#L141-1 assume !(main_~p5~0 != 0); 1922#L146-1 assume !(main_~p6~0 != 0); 1918#L151-1 assume !(main_~p7~0 != 0); 1915#L156-1 assume !(main_~p8~0 != 0); 1912#L161-1 assume !(main_~p9~0 != 0); 1910#L166-1 assume !(main_~p10~0 != 0); 1901#L171-1 assume !(main_~p11~0 != 0); 1890#L176-1 assume !(main_~p12~0 != 0); 1771#L181-1 [2018-11-10 06:01:26,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,483 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 06:01:26,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:26,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1529041554, now seen corresponding path program 1 times [2018-11-10 06:01:26,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:26,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:26,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:26,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:01:26,518 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:01:26,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:01:26,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:01:26,519 INFO L87 Difference]: Start difference. First operand 594 states and 914 transitions. cyclomatic complexity: 336 Second operand 3 states. [2018-11-10 06:01:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:26,545 INFO L93 Difference]: Finished difference Result 1170 states and 1778 transitions. [2018-11-10 06:01:26,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:01:26,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1170 states and 1778 transitions. [2018-11-10 06:01:26,553 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1168 [2018-11-10 06:01:26,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1170 states to 1170 states and 1778 transitions. [2018-11-10 06:01:26,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1170 [2018-11-10 06:01:26,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1170 [2018-11-10 06:01:26,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1170 states and 1778 transitions. [2018-11-10 06:01:26,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:26,560 INFO L705 BuchiCegarLoop]: Abstraction has 1170 states and 1778 transitions. [2018-11-10 06:01:26,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states and 1778 transitions. [2018-11-10 06:01:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1170. [2018-11-10 06:01:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2018-11-10 06:01:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1778 transitions. [2018-11-10 06:01:26,581 INFO L728 BuchiCegarLoop]: Abstraction has 1170 states and 1778 transitions. [2018-11-10 06:01:26,581 INFO L608 BuchiCegarLoop]: Abstraction has 1170 states and 1778 transitions. [2018-11-10 06:01:26,581 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 06:01:26,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1170 states and 1778 transitions. [2018-11-10 06:01:26,586 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1168 [2018-11-10 06:01:26,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:26,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:26,586 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:01:26,587 INFO L867 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] [2018-11-10 06:01:26,587 INFO L793 eck$LassoCheckResult]: Stem: 3565#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3540#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 3541#L181-1 [2018-11-10 06:01:26,587 INFO L795 eck$LassoCheckResult]: Loop: 3541#L181-1 assume true; 3678#L45-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 3676#L47 assume !(main_~cond~0 == 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; 3673#L76 assume !(main_~p1~0 != 0); 3670#L76-2 assume !(main_~p2~0 != 0); 3621#L80-1 assume !(main_~p3~0 != 0); 3617#L84-1 assume !(main_~p4~0 != 0); 3605#L88-1 assume !(main_~p5~0 != 0); 3606#L92-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 3841#L96-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 3594#L100-1 assume !(main_~p8~0 != 0); 3595#L104-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 3587#L108-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 3584#L112-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 3585#L116-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 3811#L120-1 assume !(main_~p1~0 != 0); 3785#L126-1 assume !(main_~p2~0 != 0); 3781#L131-1 assume !(main_~p3~0 != 0); 3765#L136-1 assume !(main_~p4~0 != 0); 3763#L141-1 assume !(main_~p5~0 != 0); 3725#L146-1 assume !(main_~p6~0 != 0); 3721#L151-1 assume !(main_~p7~0 != 0); 3718#L156-1 assume !(main_~p8~0 != 0); 3717#L161-1 assume !(main_~p9~0 != 0); 3715#L166-1 assume !(main_~p10~0 != 0); 3704#L171-1 assume !(main_~p11~0 != 0); 3683#L176-1 assume !(main_~p12~0 != 0); 3541#L181-1 [2018-11-10 06:01:26,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,588 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 06:01:26,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:26,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,592 INFO L82 PathProgramCache]: Analyzing trace with hash 711393104, now seen corresponding path program 1 times [2018-11-10 06:01:26,592 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:26,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:26,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:26,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:01:26,622 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:01:26,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:01:26,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:01:26,623 INFO L87 Difference]: Start difference. First operand 1170 states and 1778 transitions. cyclomatic complexity: 640 Second operand 3 states. [2018-11-10 06:01:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:26,654 INFO L93 Difference]: Finished difference Result 2306 states and 3458 transitions. [2018-11-10 06:01:26,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:01:26,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2306 states and 3458 transitions. [2018-11-10 06:01:26,668 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2304 [2018-11-10 06:01:26,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2306 states to 2306 states and 3458 transitions. [2018-11-10 06:01:26,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2306 [2018-11-10 06:01:26,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2306 [2018-11-10 06:01:26,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2306 states and 3458 transitions. [2018-11-10 06:01:26,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:26,680 INFO L705 BuchiCegarLoop]: Abstraction has 2306 states and 3458 transitions. [2018-11-10 06:01:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states and 3458 transitions. [2018-11-10 06:01:26,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2306. [2018-11-10 06:01:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2018-11-10 06:01:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3458 transitions. [2018-11-10 06:01:26,714 INFO L728 BuchiCegarLoop]: Abstraction has 2306 states and 3458 transitions. [2018-11-10 06:01:26,714 INFO L608 BuchiCegarLoop]: Abstraction has 2306 states and 3458 transitions. [2018-11-10 06:01:26,714 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 06:01:26,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2306 states and 3458 transitions. [2018-11-10 06:01:26,723 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2304 [2018-11-10 06:01:26,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:26,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:26,724 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:01:26,724 INFO L867 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] [2018-11-10 06:01:26,725 INFO L793 eck$LassoCheckResult]: Stem: 7046#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7021#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 7022#L181-1 [2018-11-10 06:01:26,725 INFO L795 eck$LassoCheckResult]: Loop: 7022#L181-1 assume true; 7119#L45-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 7117#L47 assume !(main_~cond~0 == 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; 7115#L76 assume !(main_~p1~0 != 0); 7111#L76-2 assume !(main_~p2~0 != 0); 7107#L80-1 assume !(main_~p3~0 != 0); 7103#L84-1 assume !(main_~p4~0 != 0); 7099#L88-1 assume !(main_~p5~0 != 0); 7095#L92-1 assume !(main_~p6~0 != 0); 7093#L96-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 7091#L100-1 assume !(main_~p8~0 != 0); 7089#L104-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 7087#L108-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 7085#L112-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 7083#L116-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 7080#L120-1 assume !(main_~p1~0 != 0); 7081#L126-1 assume !(main_~p2~0 != 0); 7158#L131-1 assume !(main_~p3~0 != 0); 7154#L136-1 assume !(main_~p4~0 != 0); 7150#L141-1 assume !(main_~p5~0 != 0); 7146#L146-1 assume !(main_~p6~0 != 0); 7143#L151-1 assume !(main_~p7~0 != 0); 7138#L156-1 assume !(main_~p8~0 != 0); 7135#L161-1 assume !(main_~p9~0 != 0); 7131#L166-1 assume !(main_~p10~0 != 0); 7126#L171-1 assume !(main_~p11~0 != 0); 7123#L176-1 assume !(main_~p12~0 != 0); 7022#L181-1 [2018-11-10 06:01:26,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,725 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 06:01:26,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:26,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,729 INFO L82 PathProgramCache]: Analyzing trace with hash -977550638, now seen corresponding path program 1 times [2018-11-10 06:01:26,729 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:26,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:26,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:26,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:01:26,754 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:01:26,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:01:26,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:01:26,755 INFO L87 Difference]: Start difference. First operand 2306 states and 3458 transitions. cyclomatic complexity: 1216 Second operand 3 states. [2018-11-10 06:01:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:26,787 INFO L93 Difference]: Finished difference Result 4546 states and 6722 transitions. [2018-11-10 06:01:26,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:01:26,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4546 states and 6722 transitions. [2018-11-10 06:01:26,810 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4544 [2018-11-10 06:01:26,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4546 states to 4546 states and 6722 transitions. [2018-11-10 06:01:26,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4546 [2018-11-10 06:01:26,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4546 [2018-11-10 06:01:26,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4546 states and 6722 transitions. [2018-11-10 06:01:26,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:26,839 INFO L705 BuchiCegarLoop]: Abstraction has 4546 states and 6722 transitions. [2018-11-10 06:01:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states and 6722 transitions. [2018-11-10 06:01:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 4546. [2018-11-10 06:01:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4546 states. [2018-11-10 06:01:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4546 states to 4546 states and 6722 transitions. [2018-11-10 06:01:26,917 INFO L728 BuchiCegarLoop]: Abstraction has 4546 states and 6722 transitions. [2018-11-10 06:01:26,917 INFO L608 BuchiCegarLoop]: Abstraction has 4546 states and 6722 transitions. [2018-11-10 06:01:26,917 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 06:01:26,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4546 states and 6722 transitions. [2018-11-10 06:01:26,935 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4544 [2018-11-10 06:01:26,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:26,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:26,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:01:26,936 INFO L867 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] [2018-11-10 06:01:26,936 INFO L793 eck$LassoCheckResult]: Stem: 13907#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 13880#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 13881#L181-1 [2018-11-10 06:01:26,936 INFO L795 eck$LassoCheckResult]: Loop: 13881#L181-1 assume true; 14526#L45-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 14196#L47 assume !(main_~cond~0 == 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; 14197#L76 assume !(main_~p1~0 != 0); 14283#L76-2 assume !(main_~p2~0 != 0); 14281#L80-1 assume !(main_~p3~0 != 0); 14279#L84-1 assume !(main_~p4~0 != 0); 14277#L88-1 assume !(main_~p5~0 != 0); 14274#L92-1 assume !(main_~p6~0 != 0); 14270#L96-1 assume !(main_~p7~0 != 0); 14271#L100-1 assume !(main_~p8~0 != 0); 14320#L104-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 14318#L108-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 14316#L112-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 14314#L116-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 14311#L120-1 assume !(main_~p1~0 != 0); 14312#L126-1 assume !(main_~p2~0 != 0); 14178#L131-1 assume !(main_~p3~0 != 0); 14180#L136-1 assume !(main_~p4~0 != 0); 14168#L141-1 assume !(main_~p5~0 != 0); 14163#L146-1 assume !(main_~p6~0 != 0); 14165#L151-1 assume !(main_~p7~0 != 0); 14549#L156-1 assume !(main_~p8~0 != 0); 14547#L161-1 assume !(main_~p9~0 != 0); 14545#L166-1 assume !(main_~p10~0 != 0); 14540#L171-1 assume !(main_~p11~0 != 0); 14537#L176-1 assume !(main_~p12~0 != 0); 13881#L181-1 [2018-11-10 06:01:26,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,939 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-10 06:01:26,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:26,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:26,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:26,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1323271952, now seen corresponding path program 1 times [2018-11-10 06:01:26,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:26,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:26,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:26,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:26,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:26,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:01:26,963 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:01:26,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:01:26,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:01:26,963 INFO L87 Difference]: Start difference. First operand 4546 states and 6722 transitions. cyclomatic complexity: 2304 Second operand 3 states. [2018-11-10 06:01:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:26,999 INFO L93 Difference]: Finished difference Result 8962 states and 13058 transitions. [2018-11-10 06:01:27,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:01:27,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8962 states and 13058 transitions. [2018-11-10 06:01:27,040 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8960 [2018-11-10 06:01:27,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8962 states to 8962 states and 13058 transitions. [2018-11-10 06:01:27,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8962 [2018-11-10 06:01:27,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8962 [2018-11-10 06:01:27,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8962 states and 13058 transitions. [2018-11-10 06:01:27,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:27,094 INFO L705 BuchiCegarLoop]: Abstraction has 8962 states and 13058 transitions. [2018-11-10 06:01:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8962 states and 13058 transitions. [2018-11-10 06:01:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8962 to 8962. [2018-11-10 06:01:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8962 states. [2018-11-10 06:01:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8962 states to 8962 states and 13058 transitions. [2018-11-10 06:01:27,250 INFO L728 BuchiCegarLoop]: Abstraction has 8962 states and 13058 transitions. [2018-11-10 06:01:27,250 INFO L608 BuchiCegarLoop]: Abstraction has 8962 states and 13058 transitions. [2018-11-10 06:01:27,250 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 06:01:27,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8962 states and 13058 transitions. [2018-11-10 06:01:27,273 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8960 [2018-11-10 06:01:27,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:27,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:27,274 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:01:27,274 INFO L867 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] [2018-11-10 06:01:27,274 INFO L793 eck$LassoCheckResult]: Stem: 27421#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 27393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 27394#L181-1 [2018-11-10 06:01:27,274 INFO L795 eck$LassoCheckResult]: Loop: 27394#L181-1 assume true; 27529#L45-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 27527#L47 assume !(main_~cond~0 == 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; 27523#L76 assume !(main_~p1~0 != 0); 27521#L76-2 assume !(main_~p2~0 != 0); 27517#L80-1 assume !(main_~p3~0 != 0); 27513#L84-1 assume !(main_~p4~0 != 0); 27509#L88-1 assume !(main_~p5~0 != 0); 27505#L92-1 assume !(main_~p6~0 != 0); 27501#L96-1 assume !(main_~p7~0 != 0); 27499#L100-1 assume !(main_~p8~0 != 0); 27495#L104-1 assume !(main_~p9~0 != 0); 27493#L108-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 27491#L112-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 27489#L116-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 27485#L120-1 assume !(main_~p1~0 != 0); 27482#L126-1 assume !(main_~p2~0 != 0); 27483#L131-1 assume !(main_~p3~0 != 0); 27564#L136-1 assume !(main_~p4~0 != 0); 27560#L141-1 assume !(main_~p5~0 != 0); 27556#L146-1 assume !(main_~p6~0 != 0); 27552#L151-1 assume !(main_~p7~0 != 0); 27548#L156-1 assume !(main_~p8~0 != 0); 27544#L161-1 assume !(main_~p9~0 != 0); 27541#L166-1 assume !(main_~p10~0 != 0); 27536#L171-1 assume !(main_~p11~0 != 0); 27533#L176-1 assume !(main_~p12~0 != 0); 27394#L181-1 [2018-11-10 06:01:27,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:27,275 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-11-10 06:01:27,275 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:27,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:27,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:27,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:27,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:27,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:27,280 INFO L82 PathProgramCache]: Analyzing trace with hash 302203598, now seen corresponding path program 1 times [2018-11-10 06:01:27,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:27,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:27,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:27,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:27,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:27,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:27,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:01:27,302 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:01:27,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:01:27,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:01:27,302 INFO L87 Difference]: Start difference. First operand 8962 states and 13058 transitions. cyclomatic complexity: 4352 Second operand 3 states. [2018-11-10 06:01:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:27,337 INFO L93 Difference]: Finished difference Result 17666 states and 25346 transitions. [2018-11-10 06:01:27,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:01:27,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17666 states and 25346 transitions. [2018-11-10 06:01:27,377 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17664 [2018-11-10 06:01:27,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17666 states to 17666 states and 25346 transitions. [2018-11-10 06:01:27,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17666 [2018-11-10 06:01:27,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17666 [2018-11-10 06:01:27,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17666 states and 25346 transitions. [2018-11-10 06:01:27,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:27,428 INFO L705 BuchiCegarLoop]: Abstraction has 17666 states and 25346 transitions. [2018-11-10 06:01:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17666 states and 25346 transitions. [2018-11-10 06:01:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17666 to 17666. [2018-11-10 06:01:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17666 states. [2018-11-10 06:01:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17666 states to 17666 states and 25346 transitions. [2018-11-10 06:01:27,585 INFO L728 BuchiCegarLoop]: Abstraction has 17666 states and 25346 transitions. [2018-11-10 06:01:27,585 INFO L608 BuchiCegarLoop]: Abstraction has 17666 states and 25346 transitions. [2018-11-10 06:01:27,585 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 06:01:27,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17666 states and 25346 transitions. [2018-11-10 06:01:27,619 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17664 [2018-11-10 06:01:27,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:27,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:27,620 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:01:27,620 INFO L867 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] [2018-11-10 06:01:27,620 INFO L793 eck$LassoCheckResult]: Stem: 54057#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 54026#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 54027#L181-1 [2018-11-10 06:01:27,620 INFO L795 eck$LassoCheckResult]: Loop: 54027#L181-1 assume true; 54252#L45-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 54250#L47 assume !(main_~cond~0 == 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; 54248#L76 assume !(main_~p1~0 != 0); 54238#L76-2 assume !(main_~p2~0 != 0); 54239#L80-1 assume !(main_~p3~0 != 0); 54219#L84-1 assume !(main_~p4~0 != 0); 54221#L88-1 assume !(main_~p5~0 != 0); 54195#L92-1 assume !(main_~p6~0 != 0); 54197#L96-1 assume !(main_~p7~0 != 0); 54175#L100-1 assume !(main_~p8~0 != 0); 54176#L104-1 assume !(main_~p9~0 != 0); 54151#L108-1 assume !(main_~p10~0 != 0); 54153#L112-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 54136#L116-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 54137#L120-1 assume !(main_~p1~0 != 0); 54292#L126-1 assume !(main_~p2~0 != 0); 54288#L131-1 assume !(main_~p3~0 != 0); 54284#L136-1 assume !(main_~p4~0 != 0); 54280#L141-1 assume !(main_~p5~0 != 0); 54276#L146-1 assume !(main_~p6~0 != 0); 54274#L151-1 assume !(main_~p7~0 != 0); 54272#L156-1 assume !(main_~p8~0 != 0); 54268#L161-1 assume !(main_~p9~0 != 0); 54264#L166-1 assume !(main_~p10~0 != 0); 54260#L171-1 assume !(main_~p11~0 != 0); 54257#L176-1 assume !(main_~p12~0 != 0); 54027#L181-1 [2018-11-10 06:01:27,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:27,620 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-11-10 06:01:27,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:27,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:27,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:27,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:27,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:27,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:27,626 INFO L82 PathProgramCache]: Analyzing trace with hash -977660080, now seen corresponding path program 1 times [2018-11-10 06:01:27,626 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:27,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:27,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:27,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:27,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:27,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:27,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:01:27,646 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:01:27,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:01:27,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:01:27,647 INFO L87 Difference]: Start difference. First operand 17666 states and 25346 transitions. cyclomatic complexity: 8192 Second operand 3 states. [2018-11-10 06:01:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:27,743 INFO L93 Difference]: Finished difference Result 34818 states and 49154 transitions. [2018-11-10 06:01:27,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:01:27,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34818 states and 49154 transitions. [2018-11-10 06:01:27,820 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 34816 [2018-11-10 06:01:27,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34818 states to 34818 states and 49154 transitions. [2018-11-10 06:01:27,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34818 [2018-11-10 06:01:27,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34818 [2018-11-10 06:01:27,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34818 states and 49154 transitions. [2018-11-10 06:01:27,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:27,902 INFO L705 BuchiCegarLoop]: Abstraction has 34818 states and 49154 transitions. [2018-11-10 06:01:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34818 states and 49154 transitions. [2018-11-10 06:01:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34818 to 34818. [2018-11-10 06:01:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34818 states. [2018-11-10 06:01:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34818 states to 34818 states and 49154 transitions. [2018-11-10 06:01:28,201 INFO L728 BuchiCegarLoop]: Abstraction has 34818 states and 49154 transitions. [2018-11-10 06:01:28,201 INFO L608 BuchiCegarLoop]: Abstraction has 34818 states and 49154 transitions. [2018-11-10 06:01:28,201 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 06:01:28,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34818 states and 49154 transitions. [2018-11-10 06:01:28,354 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 34816 [2018-11-10 06:01:28,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:28,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:28,355 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:01:28,355 INFO L867 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] [2018-11-10 06:01:28,355 INFO L793 eck$LassoCheckResult]: Stem: 106547#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 106516#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 106517#L181-1 [2018-11-10 06:01:28,355 INFO L795 eck$LassoCheckResult]: Loop: 106517#L181-1 assume true; 107234#L45-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 107226#L47 assume !(main_~cond~0 == 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; 107227#L76 assume !(main_~p1~0 != 0); 107204#L76-2 assume !(main_~p2~0 != 0); 107206#L80-1 assume !(main_~p3~0 != 0); 107186#L84-1 assume !(main_~p4~0 != 0); 107188#L88-1 assume !(main_~p5~0 != 0); 107331#L92-1 assume !(main_~p6~0 != 0); 107327#L96-1 assume !(main_~p7~0 != 0); 107325#L100-1 assume !(main_~p8~0 != 0); 107321#L104-1 assume !(main_~p9~0 != 0); 107316#L108-1 assume !(main_~p10~0 != 0); 107312#L112-1 assume !(main_~p11~0 != 0); 107308#L116-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 107303#L120-1 assume !(main_~p1~0 != 0); 107297#L126-1 assume !(main_~p2~0 != 0); 107289#L131-1 assume !(main_~p3~0 != 0); 107280#L136-1 assume !(main_~p4~0 != 0); 107271#L141-1 assume !(main_~p5~0 != 0); 107264#L146-1 assume !(main_~p6~0 != 0); 107260#L151-1 assume !(main_~p7~0 != 0); 107257#L156-1 assume !(main_~p8~0 != 0); 107253#L161-1 assume !(main_~p9~0 != 0); 107223#L166-1 assume !(main_~p10~0 != 0); 107224#L171-1 assume !(main_~p11~0 != 0); 107242#L176-1 assume !(main_~p12~0 != 0); 106517#L181-1 [2018-11-10 06:01:28,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:28,356 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2018-11-10 06:01:28,356 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:28,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:28,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:28,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:28,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:28,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:28,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1988777330, now seen corresponding path program 1 times [2018-11-10 06:01:28,360 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:28,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:28,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:28,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:28,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:28,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:28,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:01:28,383 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:01:28,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:01:28,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:01:28,383 INFO L87 Difference]: Start difference. First operand 34818 states and 49154 transitions. cyclomatic complexity: 15360 Second operand 3 states. [2018-11-10 06:01:28,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:28,502 INFO L93 Difference]: Finished difference Result 68610 states and 95234 transitions. [2018-11-10 06:01:28,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:01:28,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68610 states and 95234 transitions. [2018-11-10 06:01:28,675 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 68608 [2018-11-10 06:01:28,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68610 states to 68610 states and 95234 transitions. [2018-11-10 06:01:28,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68610 [2018-11-10 06:01:28,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68610 [2018-11-10 06:01:28,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68610 states and 95234 transitions. [2018-11-10 06:01:28,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:28,850 INFO L705 BuchiCegarLoop]: Abstraction has 68610 states and 95234 transitions. [2018-11-10 06:01:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68610 states and 95234 transitions. [2018-11-10 06:01:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68610 to 68610. [2018-11-10 06:01:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68610 states. [2018-11-10 06:01:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68610 states to 68610 states and 95234 transitions. [2018-11-10 06:01:29,447 INFO L728 BuchiCegarLoop]: Abstraction has 68610 states and 95234 transitions. [2018-11-10 06:01:29,447 INFO L608 BuchiCegarLoop]: Abstraction has 68610 states and 95234 transitions. [2018-11-10 06:01:29,448 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 06:01:29,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68610 states and 95234 transitions. [2018-11-10 06:01:29,573 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 68608 [2018-11-10 06:01:29,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:29,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:29,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:01:29,574 INFO L867 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] [2018-11-10 06:01:29,575 INFO L793 eck$LassoCheckResult]: Stem: 209983#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 209950#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 209951#L181-1 [2018-11-10 06:01:29,575 INFO L795 eck$LassoCheckResult]: Loop: 209951#L181-1 assume true; 210094#L45-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 210092#L47 assume !(main_~cond~0 == 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; 210089#L76 assume !(main_~p1~0 != 0); 210085#L76-2 assume !(main_~p2~0 != 0); 210081#L80-1 assume !(main_~p3~0 != 0); 210077#L84-1 assume !(main_~p4~0 != 0); 210073#L88-1 assume !(main_~p5~0 != 0); 210069#L92-1 assume !(main_~p6~0 != 0); 210065#L96-1 assume !(main_~p7~0 != 0); 210062#L100-1 assume !(main_~p8~0 != 0); 210059#L104-1 assume !(main_~p9~0 != 0); 210060#L108-1 assume !(main_~p10~0 != 0); 210147#L112-1 assume !(main_~p11~0 != 0); 210143#L116-1 assume !(main_~p12~0 != 0); 210139#L120-1 assume !(main_~p1~0 != 0); 210135#L126-1 assume !(main_~p2~0 != 0); 210131#L131-1 assume !(main_~p3~0 != 0); 210127#L136-1 assume !(main_~p4~0 != 0); 210123#L141-1 assume !(main_~p5~0 != 0); 210119#L146-1 assume !(main_~p6~0 != 0); 210115#L151-1 assume !(main_~p7~0 != 0); 210111#L156-1 assume !(main_~p8~0 != 0); 210109#L161-1 assume !(main_~p9~0 != 0); 210106#L166-1 assume !(main_~p10~0 != 0); 210102#L171-1 assume !(main_~p11~0 != 0); 210098#L176-1 assume !(main_~p12~0 != 0); 209951#L181-1 [2018-11-10 06:01:29,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2018-11-10 06:01:29,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:29,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:29,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:29,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:29,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:29,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:29,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1719383952, now seen corresponding path program 1 times [2018-11-10 06:01:29,578 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:29,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:29,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:29,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:29,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:29,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:29,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1475963534, now seen corresponding path program 1 times [2018-11-10 06:01:29,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:29,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:29,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:29,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:29,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:29,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 06:01:29 BoogieIcfgContainer [2018-11-10 06:01:29,770 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 06:01:29,771 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:01:29,771 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:01:29,771 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:01:29,771 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:01:25" (3/4) ... [2018-11-10 06:01:29,773 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 06:01:29,810 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_94410a07-3963-4a70-bb13-e790f8589584/bin-2019/uautomizer/witness.graphml [2018-11-10 06:01:29,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:01:29,811 INFO L168 Benchmark]: Toolchain (without parser) took 4376.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 384.8 MB). Free memory was 960.3 MB in the beginning and 803.2 MB in the end (delta: 157.1 MB). Peak memory consumption was 542.0 MB. Max. memory is 11.5 GB. [2018-11-10 06:01:29,812 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:01:29,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.42 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 06:01:29,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.06 ms. Allocated memory is still 1.0 GB. Free memory was 949.4 MB in the beginning and 946.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:01:29,813 INFO L168 Benchmark]: Boogie Preprocessor took 16.35 ms. Allocated memory is still 1.0 GB. Free memory was 946.7 MB in the beginning and 944.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:01:29,813 INFO L168 Benchmark]: RCFGBuilder took 261.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 944.0 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-10 06:01:29,813 INFO L168 Benchmark]: BuchiAutomizer took 3884.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 259.5 MB). Free memory was 1.1 GB in the beginning and 812.2 MB in the end (delta: 290.4 MB). Peak memory consumption was 550.0 MB. Max. memory is 11.5 GB. [2018-11-10 06:01:29,814 INFO L168 Benchmark]: Witness Printer took 39.55 ms. Allocated memory is still 1.4 GB. Free memory was 812.2 MB in the beginning and 803.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2018-11-10 06:01:29,816 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 150.42 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.06 ms. Allocated memory is still 1.0 GB. Free memory was 949.4 MB in the beginning and 946.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.35 ms. Allocated memory is still 1.0 GB. Free memory was 946.7 MB in the beginning and 944.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 261.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 944.0 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3884.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 259.5 MB). Free memory was 1.1 GB in the beginning and 812.2 MB in the end (delta: 290.4 MB). Peak memory consumption was 550.0 MB. Max. memory is 11.5 GB. * Witness Printer took 39.55 ms. Allocated memory is still 1.4 GB. Free memory was 812.2 MB in the beginning and 803.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 68610 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had 68610 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1072 SDtfs, 555 SDslu, 664 SDs, 0 SdLazy, 55 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI11 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: 45]: 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@5ed02cd5=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38ad29f6=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57227b8a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18b070f9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45b475ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@772737b6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39cad55c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@284e0b03=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45fcab2b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44232f4c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46d75abc=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5295cbed=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79fd6565=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 45]: 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; [L43] int cond; Loop: [L45] COND TRUE 1 [L46] cond = __VERIFIER_nondet_int() [L47] COND FALSE !(cond == 0) [L50] lk1 = 0 [L52] lk2 = 0 [L54] lk3 = 0 [L56] lk4 = 0 [L58] lk5 = 0 [L60] lk6 = 0 [L62] lk7 = 0 [L64] lk8 = 0 [L66] lk9 = 0 [L68] lk10 = 0 [L70] lk11 = 0 [L72] lk12 = 0 [L76] COND FALSE !(p1 != 0) [L80] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L88] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L96] COND FALSE !(p6 != 0) [L100] COND FALSE !(p7 != 0) [L104] COND FALSE !(p8 != 0) [L108] COND FALSE !(p9 != 0) [L112] COND FALSE !(p10 != 0) [L116] COND FALSE !(p11 != 0) [L120] COND FALSE !(p12 != 0) [L126] COND FALSE !(p1 != 0) [L131] COND FALSE !(p2 != 0) [L136] COND FALSE !(p3 != 0) [L141] COND FALSE !(p4 != 0) [L146] COND FALSE !(p5 != 0) [L151] COND FALSE !(p6 != 0) [L156] COND FALSE !(p7 != 0) [L161] COND FALSE !(p8 != 0) [L166] COND FALSE !(p9 != 0) [L171] COND FALSE !(p10 != 0) [L176] COND FALSE !(p11 != 0) [L181] COND FALSE !(p12 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...