./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_14-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_14-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/bin/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 4c4a63b42b00dbfea9a5b040626d99ec84a4e61b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.24-cad4683 [2019-10-22 09:01:00,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:00,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:00,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:00,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:00,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:00,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:00,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:00,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:00,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:00,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:00,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:00,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:00,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:00,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:00,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:00,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:00,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:00,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:00,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:00,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:00,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:00,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:00,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:00,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:00,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:00,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:00,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:00,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:00,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:00,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:00,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:00,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:00,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:00,653 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:00,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:00,654 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:00,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:00,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:00,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:00,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:00,657 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:01:00,669 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:00,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:00,671 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:00,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:00,671 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:00,671 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:00,671 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:00,672 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:00,672 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:00,672 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:00,672 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:00,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:00,673 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:00,673 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:00,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:00,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:00,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:00,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:00,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:00,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:00,674 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:00,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:00,675 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:00,675 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:00,675 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:00,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:00,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:00,675 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:00,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:00,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:00,676 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:00,677 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:00,677 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/bin/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 -> 4c4a63b42b00dbfea9a5b040626d99ec84a4e61b [2019-10-22 09:01:00,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:00,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:00,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:00,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:00,718 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:00,719 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_14-2.c [2019-10-22 09:01:00,763 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/bin/uautomizer/data/26e58e3ca/f1010cc9c34f48dc8073862c02775294/FLAG8c11f735d [2019-10-22 09:01:01,137 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:01,138 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/sv-benchmarks/c/locks/test_locks_14-2.c [2019-10-22 09:01:01,145 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/bin/uautomizer/data/26e58e3ca/f1010cc9c34f48dc8073862c02775294/FLAG8c11f735d [2019-10-22 09:01:01,155 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/bin/uautomizer/data/26e58e3ca/f1010cc9c34f48dc8073862c02775294 [2019-10-22 09:01:01,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:01,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:01,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:01,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:01,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:01,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:01" (1/1) ... [2019-10-22 09:01:01,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24da03c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:01, skipping insertion in model container [2019-10-22 09:01:01,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:01" (1/1) ... [2019-10-22 09:01:01,178 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:01,202 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:01,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:01,345 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:01,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:01,449 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:01,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:01 WrapperNode [2019-10-22 09:01:01,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:01,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:01,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:01,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:01,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:01" (1/1) ... [2019-10-22 09:01:01,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:01" (1/1) ... [2019-10-22 09:01:01,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:01,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:01,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:01,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:01,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:01" (1/1) ... [2019-10-22 09:01:01,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:01" (1/1) ... [2019-10-22 09:01:01,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:01" (1/1) ... [2019-10-22 09:01:01,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:01" (1/1) ... [2019-10-22 09:01:01,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:01" (1/1) ... [2019-10-22 09:01:01,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:01" (1/1) ... [2019-10-22 09:01:01,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:01" (1/1) ... [2019-10-22 09:01:01,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:01,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:01,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:01,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:01,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/bin/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 [2019-10-22 09:01:01,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:01,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:01,939 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:01,939 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 09:01:01,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:01 BoogieIcfgContainer [2019-10-22 09:01:01,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:01,942 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:01,942 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:01,946 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:01,947 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:01,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:01" (1/3) ... [2019-10-22 09:01:01,959 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4106467f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:01, skipping insertion in model container [2019-10-22 09:01:01,959 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:01,959 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:01" (2/3) ... [2019-10-22 09:01:01,960 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4106467f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:01, skipping insertion in model container [2019-10-22 09:01:01,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:01,960 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:01" (3/3) ... [2019-10-22 09:01:01,962 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_14-2.c [2019-10-22 09:01:02,037 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:02,037 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:02,037 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:02,038 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:02,038 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:02,038 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:02,038 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:02,038 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:02,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2019-10-22 09:01:02,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2019-10-22 09:01:02,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:02,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:02,120 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:01:02,120 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:02,120 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:02,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2019-10-22 09:01:02,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2019-10-22 09:01:02,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:02,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:02,125 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:01:02,125 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:02,135 INFO L791 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 18#L209true [2019-10-22 09:01:02,136 INFO L793 eck$LassoCheckResult]: Loop: 18#L209true assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 47#L53true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 48#L86true assume 0 != main_~p1~0;main_~lk1~0 := 1; 34#L86-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 51#L90-1true assume !(0 != main_~p3~0); 43#L94-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 12#L98-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 4#L102-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 7#L106-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 25#L110-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 19#L114-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 35#L118-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 38#L122-1true assume !(0 != main_~p11~0); 32#L126-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 49#L130-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 40#L134-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 45#L138-1true assume !(0 != main_~p1~0); 28#L144-1true assume 0 != main_~p2~0; 23#L150true assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 9#L149true assume !(0 != main_~p3~0); 27#L154-1true assume !(0 != main_~p4~0); 33#L159-1true assume !(0 != main_~p5~0); 16#L164-1true assume !(0 != main_~p6~0); 20#L169-1true assume !(0 != main_~p7~0); 50#L174-1true assume !(0 != main_~p8~0); 5#L179-1true assume !(0 != main_~p9~0); 36#L184-1true assume !(0 != main_~p10~0); 42#L189-1true assume !(0 != main_~p11~0); 24#L194-1true assume !(0 != main_~p12~0); 30#L199-1true assume !(0 != main_~p13~0); 11#L204-1true assume 0 != main_~p14~0; 31#L210true assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 18#L209true [2019-10-22 09:01:02,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,143 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-10-22 09:01:02,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235297483] [2019-10-22 09:01:02,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:02,280 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:02,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,281 INFO L82 PathProgramCache]: Analyzing trace with hash -878582343, now seen corresponding path program 1 times [2019-10-22 09:01:02,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347649402] [2019-10-22 09:01:02,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:02,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347649402] [2019-10-22 09:01:02,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:02,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:02,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029225957] [2019-10-22 09:01:02,367 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:02,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:02,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:02,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:02,386 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-10-22 09:01:02,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:02,437 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2019-10-22 09:01:02,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:02,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 177 transitions. [2019-10-22 09:01:02,442 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2019-10-22 09:01:02,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 88 states and 138 transitions. [2019-10-22 09:01:02,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-10-22 09:01:02,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2019-10-22 09:01:02,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 138 transitions. [2019-10-22 09:01:02,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:02,450 INFO L688 BuchiCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-10-22 09:01:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 138 transitions. [2019-10-22 09:01:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-10-22 09:01:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-22 09:01:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-10-22 09:01:02,475 INFO L711 BuchiCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-10-22 09:01:02,475 INFO L591 BuchiCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-10-22 09:01:02,475 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:02,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 138 transitions. [2019-10-22 09:01:02,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2019-10-22 09:01:02,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:02,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:02,478 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:01:02,478 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:02,478 INFO L791 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 169#L209 [2019-10-22 09:01:02,479 INFO L793 eck$LassoCheckResult]: Loop: 169#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 206#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 207#L86 assume !(0 != main_~p1~0); 210#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 244#L90-1 assume !(0 != main_~p3~0); 243#L94-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 242#L98-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 241#L102-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 240#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 239#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 238#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 237#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 236#L122-1 assume !(0 != main_~p11~0); 235#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 234#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 233#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 232#L138-1 assume !(0 != main_~p1~0); 231#L144-1 assume 0 != main_~p2~0; 230#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 229#L149 assume !(0 != main_~p3~0); 227#L154-1 assume !(0 != main_~p4~0); 225#L159-1 assume !(0 != main_~p5~0); 193#L164-1 assume !(0 != main_~p6~0); 194#L169-1 assume !(0 != main_~p7~0); 160#L174-1 assume !(0 != main_~p8~0); 170#L179-1 assume !(0 != main_~p9~0); 171#L184-1 assume !(0 != main_~p10~0); 202#L189-1 assume !(0 != main_~p11~0); 192#L194-1 assume !(0 != main_~p12~0); 165#L199-1 assume !(0 != main_~p13~0); 166#L204-1 assume 0 != main_~p14~0; 168#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 169#L209 [2019-10-22 09:01:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-10-22 09:01:02,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955292133] [2019-10-22 09:01:02,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:02,491 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:02,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,491 INFO L82 PathProgramCache]: Analyzing trace with hash -855950089, now seen corresponding path program 1 times [2019-10-22 09:01:02,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592414243] [2019-10-22 09:01:02,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:02,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592414243] [2019-10-22 09:01:02,534 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:02,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:02,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190507677] [2019-10-22 09:01:02,534 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:02,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:02,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:02,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:02,535 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. cyclomatic complexity: 52 Second operand 3 states. [2019-10-22 09:01:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:02,566 INFO L93 Difference]: Finished difference Result 173 states and 269 transitions. [2019-10-22 09:01:02,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:02,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 269 transitions. [2019-10-22 09:01:02,568 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2019-10-22 09:01:02,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 173 states and 269 transitions. [2019-10-22 09:01:02,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2019-10-22 09:01:02,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2019-10-22 09:01:02,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 269 transitions. [2019-10-22 09:01:02,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:02,571 INFO L688 BuchiCegarLoop]: Abstraction has 173 states and 269 transitions. [2019-10-22 09:01:02,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 269 transitions. [2019-10-22 09:01:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-10-22 09:01:02,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-22 09:01:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions. [2019-10-22 09:01:02,583 INFO L711 BuchiCegarLoop]: Abstraction has 173 states and 269 transitions. [2019-10-22 09:01:02,583 INFO L591 BuchiCegarLoop]: Abstraction has 173 states and 269 transitions. [2019-10-22 09:01:02,584 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:01:02,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 269 transitions. [2019-10-22 09:01:02,586 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2019-10-22 09:01:02,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:02,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:02,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:01:02,590 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:02,590 INFO L791 eck$LassoCheckResult]: Stem: 473#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 474#L209 [2019-10-22 09:01:02,590 INFO L793 eck$LassoCheckResult]: Loop: 474#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 489#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 490#L86 assume !(0 != main_~p1~0); 448#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 449#L90-1 assume !(0 != main_~p3~0); 481#L94-1 assume !(0 != main_~p4~0); 483#L98-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 585#L102-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 583#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 581#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 579#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 577#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 575#L122-1 assume !(0 != main_~p11~0); 573#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 571#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 569#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 567#L138-1 assume !(0 != main_~p1~0); 566#L144-1 assume 0 != main_~p2~0; 565#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 564#L149 assume !(0 != main_~p3~0); 562#L154-1 assume !(0 != main_~p4~0); 442#L159-1 assume !(0 != main_~p5~0); 444#L164-1 assume !(0 != main_~p6~0); 456#L169-1 assume !(0 != main_~p7~0); 549#L174-1 assume !(0 != main_~p8~0); 547#L179-1 assume !(0 != main_~p9~0); 544#L184-1 assume !(0 != main_~p10~0); 543#L189-1 assume !(0 != main_~p11~0); 541#L194-1 assume !(0 != main_~p12~0); 521#L199-1 assume !(0 != main_~p13~0); 522#L204-1 assume 0 != main_~p14~0; 518#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 474#L209 [2019-10-22 09:01:02,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,590 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-10-22 09:01:02,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232862273] [2019-10-22 09:01:02,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:02,600 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:02,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1067277945, now seen corresponding path program 1 times [2019-10-22 09:01:02,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798286105] [2019-10-22 09:01:02,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:02,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798286105] [2019-10-22 09:01:02,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:02,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:02,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309208249] [2019-10-22 09:01:02,658 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:02,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:02,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:02,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:02,659 INFO L87 Difference]: Start difference. First operand 173 states and 269 transitions. cyclomatic complexity: 100 Second operand 3 states. [2019-10-22 09:01:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:02,677 INFO L93 Difference]: Finished difference Result 341 states and 525 transitions. [2019-10-22 09:01:02,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:02,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 525 transitions. [2019-10-22 09:01:02,680 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2019-10-22 09:01:02,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 341 states and 525 transitions. [2019-10-22 09:01:02,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2019-10-22 09:01:02,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 341 [2019-10-22 09:01:02,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 341 states and 525 transitions. [2019-10-22 09:01:02,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:02,685 INFO L688 BuchiCegarLoop]: Abstraction has 341 states and 525 transitions. [2019-10-22 09:01:02,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states and 525 transitions. [2019-10-22 09:01:02,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2019-10-22 09:01:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-10-22 09:01:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 525 transitions. [2019-10-22 09:01:02,705 INFO L711 BuchiCegarLoop]: Abstraction has 341 states and 525 transitions. [2019-10-22 09:01:02,705 INFO L591 BuchiCegarLoop]: Abstraction has 341 states and 525 transitions. [2019-10-22 09:01:02,705 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:01:02,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 341 states and 525 transitions. [2019-10-22 09:01:02,707 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2019-10-22 09:01:02,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:02,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:02,708 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:01:02,708 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:02,708 INFO L791 eck$LassoCheckResult]: Stem: 996#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 997#L209 [2019-10-22 09:01:02,708 INFO L793 eck$LassoCheckResult]: Loop: 997#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 1142#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 1141#L86 assume !(0 != main_~p1~0); 1007#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 1008#L90-1 assume !(0 != main_~p3~0); 1117#L94-1 assume !(0 != main_~p4~0); 1119#L98-1 assume !(0 != main_~p5~0); 1103#L102-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1104#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1091#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1092#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1079#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1080#L122-1 assume !(0 != main_~p11~0); 1066#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1067#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1056#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1057#L138-1 assume !(0 != main_~p1~0); 1134#L144-1 assume 0 != main_~p2~0; 1132#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 1129#L149 assume !(0 != main_~p3~0); 1124#L154-1 assume !(0 != main_~p4~0); 1122#L159-1 assume !(0 != main_~p5~0); 1116#L164-1 assume !(0 != main_~p6~0); 1115#L169-1 assume !(0 != main_~p7~0); 1102#L174-1 assume !(0 != main_~p8~0); 1096#L179-1 assume !(0 != main_~p9~0); 1089#L184-1 assume !(0 != main_~p10~0); 1084#L189-1 assume !(0 != main_~p11~0); 1078#L194-1 assume !(0 != main_~p12~0); 1077#L199-1 assume !(0 != main_~p13~0); 1144#L204-1 assume 0 != main_~p14~0; 1143#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 997#L209 [2019-10-22 09:01:02,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,709 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-10-22 09:01:02,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190107356] [2019-10-22 09:01:02,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:02,717 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:02,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1129317559, now seen corresponding path program 1 times [2019-10-22 09:01:02,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107755874] [2019-10-22 09:01:02,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:02,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107755874] [2019-10-22 09:01:02,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:02,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:02,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451444508] [2019-10-22 09:01:02,744 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:02,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:02,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:02,745 INFO L87 Difference]: Start difference. First operand 341 states and 525 transitions. cyclomatic complexity: 192 Second operand 3 states. [2019-10-22 09:01:02,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:02,760 INFO L93 Difference]: Finished difference Result 673 states and 1025 transitions. [2019-10-22 09:01:02,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:02,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 673 states and 1025 transitions. [2019-10-22 09:01:02,766 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2019-10-22 09:01:02,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 673 states to 673 states and 1025 transitions. [2019-10-22 09:01:02,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 673 [2019-10-22 09:01:02,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 673 [2019-10-22 09:01:02,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 673 states and 1025 transitions. [2019-10-22 09:01:02,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:02,781 INFO L688 BuchiCegarLoop]: Abstraction has 673 states and 1025 transitions. [2019-10-22 09:01:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states and 1025 transitions. [2019-10-22 09:01:02,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2019-10-22 09:01:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-10-22 09:01:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1025 transitions. [2019-10-22 09:01:02,816 INFO L711 BuchiCegarLoop]: Abstraction has 673 states and 1025 transitions. [2019-10-22 09:01:02,816 INFO L591 BuchiCegarLoop]: Abstraction has 673 states and 1025 transitions. [2019-10-22 09:01:02,816 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:01:02,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 673 states and 1025 transitions. [2019-10-22 09:01:02,822 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2019-10-22 09:01:02,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:02,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:02,823 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:01:02,823 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:02,823 INFO L791 eck$LassoCheckResult]: Stem: 2014#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 2015#L209 [2019-10-22 09:01:02,824 INFO L793 eck$LassoCheckResult]: Loop: 2015#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 2092#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 2090#L86 assume !(0 != main_~p1~0); 2088#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 2086#L90-1 assume !(0 != main_~p3~0); 2082#L94-1 assume !(0 != main_~p4~0); 2078#L98-1 assume !(0 != main_~p5~0); 2074#L102-1 assume !(0 != main_~p6~0); 2072#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2070#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2068#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2066#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2064#L122-1 assume !(0 != main_~p11~0); 2062#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2060#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2058#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2056#L138-1 assume !(0 != main_~p1~0); 2050#L144-1 assume 0 != main_~p2~0; 2051#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 2042#L149 assume !(0 != main_~p3~0); 2041#L154-1 assume !(0 != main_~p4~0); 2130#L159-1 assume !(0 != main_~p5~0); 2127#L164-1 assume !(0 != main_~p6~0); 2124#L169-1 assume !(0 != main_~p7~0); 2120#L174-1 assume !(0 != main_~p8~0); 2116#L179-1 assume !(0 != main_~p9~0); 2111#L184-1 assume !(0 != main_~p10~0); 2108#L189-1 assume !(0 != main_~p11~0); 2104#L194-1 assume !(0 != main_~p12~0); 2099#L199-1 assume !(0 != main_~p13~0); 2097#L204-1 assume 0 != main_~p14~0; 2095#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 2015#L209 [2019-10-22 09:01:02,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,824 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-10-22 09:01:02,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477468181] [2019-10-22 09:01:02,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:02,852 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:02,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1269866169, now seen corresponding path program 1 times [2019-10-22 09:01:02,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906562274] [2019-10-22 09:01:02,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:02,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906562274] [2019-10-22 09:01:02,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:02,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:02,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369595666] [2019-10-22 09:01:02,895 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:02,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:02,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:02,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:02,896 INFO L87 Difference]: Start difference. First operand 673 states and 1025 transitions. cyclomatic complexity: 368 Second operand 3 states. [2019-10-22 09:01:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:02,925 INFO L93 Difference]: Finished difference Result 1329 states and 2001 transitions. [2019-10-22 09:01:02,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:02,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1329 states and 2001 transitions. [2019-10-22 09:01:02,936 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2019-10-22 09:01:02,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1329 states to 1329 states and 2001 transitions. [2019-10-22 09:01:02,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1329 [2019-10-22 09:01:02,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1329 [2019-10-22 09:01:02,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1329 states and 2001 transitions. [2019-10-22 09:01:02,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:02,946 INFO L688 BuchiCegarLoop]: Abstraction has 1329 states and 2001 transitions. [2019-10-22 09:01:02,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states and 2001 transitions. [2019-10-22 09:01:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2019-10-22 09:01:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1329 states. [2019-10-22 09:01:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 2001 transitions. [2019-10-22 09:01:02,970 INFO L711 BuchiCegarLoop]: Abstraction has 1329 states and 2001 transitions. [2019-10-22 09:01:02,970 INFO L591 BuchiCegarLoop]: Abstraction has 1329 states and 2001 transitions. [2019-10-22 09:01:02,971 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:01:02,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1329 states and 2001 transitions. [2019-10-22 09:01:02,976 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2019-10-22 09:01:02,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:02,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:02,977 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:01:02,977 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:02,977 INFO L791 eck$LassoCheckResult]: Stem: 4027#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 4028#L209 [2019-10-22 09:01:02,977 INFO L793 eck$LassoCheckResult]: Loop: 4028#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 4527#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 4526#L86 assume !(0 != main_~p1~0); 4524#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 4351#L90-1 assume !(0 != main_~p3~0); 4352#L94-1 assume !(0 != main_~p4~0); 4513#L98-1 assume !(0 != main_~p5~0); 4544#L102-1 assume !(0 != main_~p6~0); 4545#L106-1 assume !(0 != main_~p7~0); 4629#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4630#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4623#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4624#L122-1 assume !(0 != main_~p11~0); 4617#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4618#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4610#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4611#L138-1 assume !(0 != main_~p1~0); 4712#L144-1 assume 0 != main_~p2~0; 4131#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 4132#L149 assume !(0 != main_~p3~0); 4362#L154-1 assume !(0 != main_~p4~0); 4363#L159-1 assume !(0 != main_~p5~0); 4425#L164-1 assume !(0 != main_~p6~0); 4547#L169-1 assume !(0 != main_~p7~0); 4543#L174-1 assume !(0 != main_~p8~0); 4541#L179-1 assume !(0 != main_~p9~0); 4537#L184-1 assume !(0 != main_~p10~0); 4535#L189-1 assume !(0 != main_~p11~0); 4533#L194-1 assume !(0 != main_~p12~0); 4530#L199-1 assume !(0 != main_~p13~0); 4529#L204-1 assume 0 != main_~p14~0; 4528#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 4028#L209 [2019-10-22 09:01:02,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,977 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-10-22 09:01:02,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096363961] [2019-10-22 09:01:02,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:02,985 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:02,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1135852663, now seen corresponding path program 1 times [2019-10-22 09:01:02,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566550942] [2019-10-22 09:01:02,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:03,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566550942] [2019-10-22 09:01:03,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:03,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:03,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145204467] [2019-10-22 09:01:03,007 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:03,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:03,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:03,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:03,008 INFO L87 Difference]: Start difference. First operand 1329 states and 2001 transitions. cyclomatic complexity: 704 Second operand 3 states. [2019-10-22 09:01:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:03,029 INFO L93 Difference]: Finished difference Result 2625 states and 3905 transitions. [2019-10-22 09:01:03,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:03,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2625 states and 3905 transitions. [2019-10-22 09:01:03,051 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2019-10-22 09:01:03,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2625 states to 2625 states and 3905 transitions. [2019-10-22 09:01:03,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2625 [2019-10-22 09:01:03,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2625 [2019-10-22 09:01:03,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2625 states and 3905 transitions. [2019-10-22 09:01:03,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:03,069 INFO L688 BuchiCegarLoop]: Abstraction has 2625 states and 3905 transitions. [2019-10-22 09:01:03,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states and 3905 transitions. [2019-10-22 09:01:03,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2625. [2019-10-22 09:01:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2625 states. [2019-10-22 09:01:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 3905 transitions. [2019-10-22 09:01:03,114 INFO L711 BuchiCegarLoop]: Abstraction has 2625 states and 3905 transitions. [2019-10-22 09:01:03,114 INFO L591 BuchiCegarLoop]: Abstraction has 2625 states and 3905 transitions. [2019-10-22 09:01:03,114 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:01:03,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2625 states and 3905 transitions. [2019-10-22 09:01:03,125 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2019-10-22 09:01:03,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:03,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:03,126 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:01:03,126 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:03,126 INFO L791 eck$LassoCheckResult]: Stem: 7991#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 7992#L209 [2019-10-22 09:01:03,126 INFO L793 eck$LassoCheckResult]: Loop: 7992#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 8209#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 8205#L86 assume !(0 != main_~p1~0); 8202#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 8198#L90-1 assume !(0 != main_~p3~0); 8161#L94-1 assume !(0 != main_~p4~0); 8157#L98-1 assume !(0 != main_~p5~0); 8101#L102-1 assume !(0 != main_~p6~0); 8059#L106-1 assume !(0 != main_~p7~0); 8060#L110-1 assume !(0 != main_~p8~0); 8304#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8302#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8299#L122-1 assume !(0 != main_~p11~0); 8296#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8293#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8290#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8286#L138-1 assume !(0 != main_~p1~0); 8283#L144-1 assume 0 != main_~p2~0; 8279#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 8277#L149 assume !(0 != main_~p3~0); 8273#L154-1 assume !(0 != main_~p4~0); 8270#L159-1 assume !(0 != main_~p5~0); 8266#L164-1 assume !(0 != main_~p6~0); 8263#L169-1 assume !(0 != main_~p7~0); 8260#L174-1 assume !(0 != main_~p8~0); 8257#L179-1 assume !(0 != main_~p9~0); 8251#L184-1 assume !(0 != main_~p10~0); 8250#L189-1 assume !(0 != main_~p11~0); 8246#L194-1 assume !(0 != main_~p12~0); 8225#L199-1 assume !(0 != main_~p13~0); 8221#L204-1 assume 0 != main_~p14~0; 8218#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 7992#L209 [2019-10-22 09:01:03,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:03,127 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-10-22 09:01:03,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:03,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672024411] [2019-10-22 09:01:03,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:03,137 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:03,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:03,138 INFO L82 PathProgramCache]: Analyzing trace with hash -669585671, now seen corresponding path program 1 times [2019-10-22 09:01:03,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:03,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477105947] [2019-10-22 09:01:03,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:03,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477105947] [2019-10-22 09:01:03,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:03,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:03,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821927500] [2019-10-22 09:01:03,166 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:03,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:03,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:03,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:03,167 INFO L87 Difference]: Start difference. First operand 2625 states and 3905 transitions. cyclomatic complexity: 1344 Second operand 3 states. [2019-10-22 09:01:03,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:03,198 INFO L93 Difference]: Finished difference Result 5185 states and 7617 transitions. [2019-10-22 09:01:03,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:03,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5185 states and 7617 transitions. [2019-10-22 09:01:03,225 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2019-10-22 09:01:03,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5185 states to 5185 states and 7617 transitions. [2019-10-22 09:01:03,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5185 [2019-10-22 09:01:03,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5185 [2019-10-22 09:01:03,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5185 states and 7617 transitions. [2019-10-22 09:01:03,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:03,258 INFO L688 BuchiCegarLoop]: Abstraction has 5185 states and 7617 transitions. [2019-10-22 09:01:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states and 7617 transitions. [2019-10-22 09:01:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 5185. [2019-10-22 09:01:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5185 states. [2019-10-22 09:01:03,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 7617 transitions. [2019-10-22 09:01:03,359 INFO L711 BuchiCegarLoop]: Abstraction has 5185 states and 7617 transitions. [2019-10-22 09:01:03,359 INFO L591 BuchiCegarLoop]: Abstraction has 5185 states and 7617 transitions. [2019-10-22 09:01:03,359 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:01:03,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5185 states and 7617 transitions. [2019-10-22 09:01:03,381 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2019-10-22 09:01:03,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:03,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:03,383 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:01:03,384 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:03,384 INFO L791 eck$LassoCheckResult]: Stem: 15798#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 15799#L209 [2019-10-22 09:01:03,384 INFO L793 eck$LassoCheckResult]: Loop: 15799#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 15885#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 15883#L86 assume !(0 != main_~p1~0); 15882#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 15881#L90-1 assume !(0 != main_~p3~0); 15879#L94-1 assume !(0 != main_~p4~0); 15877#L98-1 assume !(0 != main_~p5~0); 15875#L102-1 assume !(0 != main_~p6~0); 15869#L106-1 assume !(0 != main_~p7~0); 15870#L110-1 assume !(0 != main_~p8~0); 15954#L114-1 assume !(0 != main_~p9~0); 15951#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 15948#L122-1 assume !(0 != main_~p11~0); 15945#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 15942#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 15940#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 15938#L138-1 assume !(0 != main_~p1~0); 15935#L144-1 assume 0 != main_~p2~0; 15932#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 15929#L149 assume !(0 != main_~p3~0); 15924#L154-1 assume !(0 != main_~p4~0); 15920#L159-1 assume !(0 != main_~p5~0); 15916#L164-1 assume !(0 != main_~p6~0); 15913#L169-1 assume !(0 != main_~p7~0); 15910#L174-1 assume !(0 != main_~p8~0); 15907#L179-1 assume !(0 != main_~p9~0); 15904#L184-1 assume !(0 != main_~p10~0); 15901#L189-1 assume !(0 != main_~p11~0); 15898#L194-1 assume !(0 != main_~p12~0); 15894#L199-1 assume !(0 != main_~p13~0); 15891#L204-1 assume 0 != main_~p14~0; 15888#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 15799#L209 [2019-10-22 09:01:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-10-22 09:01:03,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:03,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889986287] [2019-10-22 09:01:03,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:03,397 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:03,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:03,398 INFO L82 PathProgramCache]: Analyzing trace with hash -450730953, now seen corresponding path program 1 times [2019-10-22 09:01:03,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:03,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173477290] [2019-10-22 09:01:03,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:03,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173477290] [2019-10-22 09:01:03,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:03,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:03,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208117381] [2019-10-22 09:01:03,433 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:03,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:03,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:03,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:03,434 INFO L87 Difference]: Start difference. First operand 5185 states and 7617 transitions. cyclomatic complexity: 2560 Second operand 3 states. [2019-10-22 09:01:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:03,492 INFO L93 Difference]: Finished difference Result 10241 states and 14849 transitions. [2019-10-22 09:01:03,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:03,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10241 states and 14849 transitions. [2019-10-22 09:01:03,596 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2019-10-22 09:01:03,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10241 states to 10241 states and 14849 transitions. [2019-10-22 09:01:03,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10241 [2019-10-22 09:01:03,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10241 [2019-10-22 09:01:03,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10241 states and 14849 transitions. [2019-10-22 09:01:03,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:03,665 INFO L688 BuchiCegarLoop]: Abstraction has 10241 states and 14849 transitions. [2019-10-22 09:01:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10241 states and 14849 transitions. [2019-10-22 09:01:03,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10241 to 10241. [2019-10-22 09:01:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10241 states. [2019-10-22 09:01:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10241 states to 10241 states and 14849 transitions. [2019-10-22 09:01:03,844 INFO L711 BuchiCegarLoop]: Abstraction has 10241 states and 14849 transitions. [2019-10-22 09:01:03,844 INFO L591 BuchiCegarLoop]: Abstraction has 10241 states and 14849 transitions. [2019-10-22 09:01:03,845 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:01:03,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10241 states and 14849 transitions. [2019-10-22 09:01:03,879 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2019-10-22 09:01:03,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:03,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:03,880 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:01:03,880 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:03,880 INFO L791 eck$LassoCheckResult]: Stem: 31236#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 31237#L209 [2019-10-22 09:01:03,881 INFO L793 eck$LassoCheckResult]: Loop: 31237#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 31804#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 31805#L86 assume !(0 != main_~p1~0); 31794#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 31795#L90-1 assume !(0 != main_~p3~0); 31786#L94-1 assume !(0 != main_~p4~0); 31781#L98-1 assume !(0 != main_~p5~0); 31775#L102-1 assume !(0 != main_~p6~0); 31777#L106-1 assume !(0 != main_~p7~0); 31855#L110-1 assume !(0 != main_~p8~0); 31304#L114-1 assume !(0 != main_~p9~0); 31305#L118-1 assume !(0 != main_~p10~0); 32118#L122-1 assume !(0 != main_~p11~0); 32108#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 32109#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 32098#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 32099#L138-1 assume !(0 != main_~p1~0); 32170#L144-1 assume 0 != main_~p2~0; 32169#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 32168#L149 assume !(0 != main_~p3~0); 32165#L154-1 assume !(0 != main_~p4~0); 31674#L159-1 assume !(0 != main_~p5~0); 31663#L164-1 assume !(0 != main_~p6~0); 31664#L169-1 assume !(0 != main_~p7~0); 32086#L174-1 assume !(0 != main_~p8~0); 32084#L179-1 assume !(0 != main_~p9~0); 32083#L184-1 assume !(0 != main_~p10~0); 31831#L189-1 assume !(0 != main_~p11~0); 31830#L194-1 assume !(0 != main_~p12~0); 31820#L199-1 assume !(0 != main_~p13~0); 31821#L204-1 assume 0 != main_~p14~0; 31812#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 31237#L209 [2019-10-22 09:01:03,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:03,882 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-10-22 09:01:03,882 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:03,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648222812] [2019-10-22 09:01:03,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:03,895 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:03,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:03,898 INFO L82 PathProgramCache]: Analyzing trace with hash -28029127, now seen corresponding path program 1 times [2019-10-22 09:01:03,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:03,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646576722] [2019-10-22 09:01:03,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:03,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:03,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646576722] [2019-10-22 09:01:03,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:03,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:03,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394779045] [2019-10-22 09:01:03,937 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:03,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:03,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:03,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:03,938 INFO L87 Difference]: Start difference. First operand 10241 states and 14849 transitions. cyclomatic complexity: 4864 Second operand 3 states. [2019-10-22 09:01:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:04,003 INFO L93 Difference]: Finished difference Result 20225 states and 28929 transitions. [2019-10-22 09:01:04,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:04,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20225 states and 28929 transitions. [2019-10-22 09:01:04,099 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2019-10-22 09:01:04,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20225 states to 20225 states and 28929 transitions. [2019-10-22 09:01:04,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20225 [2019-10-22 09:01:04,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20225 [2019-10-22 09:01:04,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20225 states and 28929 transitions. [2019-10-22 09:01:04,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:04,215 INFO L688 BuchiCegarLoop]: Abstraction has 20225 states and 28929 transitions. [2019-10-22 09:01:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20225 states and 28929 transitions. [2019-10-22 09:01:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20225 to 20225. [2019-10-22 09:01:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-10-22 09:01:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 28929 transitions. [2019-10-22 09:01:04,657 INFO L711 BuchiCegarLoop]: Abstraction has 20225 states and 28929 transitions. [2019-10-22 09:01:04,657 INFO L591 BuchiCegarLoop]: Abstraction has 20225 states and 28929 transitions. [2019-10-22 09:01:04,657 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:01:04,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20225 states and 28929 transitions. [2019-10-22 09:01:04,715 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2019-10-22 09:01:04,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:04,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:04,716 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:01:04,717 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:04,717 INFO L791 eck$LassoCheckResult]: Stem: 61713#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 61714#L209 [2019-10-22 09:01:04,717 INFO L793 eck$LassoCheckResult]: Loop: 61714#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 62136#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 62131#L86 assume !(0 != main_~p1~0); 62127#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 62124#L90-1 assume !(0 != main_~p3~0); 62119#L94-1 assume !(0 != main_~p4~0); 62113#L98-1 assume !(0 != main_~p5~0); 62107#L102-1 assume !(0 != main_~p6~0); 62095#L106-1 assume !(0 != main_~p7~0); 62097#L110-1 assume !(0 != main_~p8~0); 62100#L114-1 assume !(0 != main_~p9~0); 62217#L118-1 assume !(0 != main_~p10~0); 62215#L122-1 assume !(0 != main_~p11~0); 62212#L126-1 assume !(0 != main_~p12~0); 62213#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 62230#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 62228#L138-1 assume !(0 != main_~p1~0); 62227#L144-1 assume 0 != main_~p2~0; 62226#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 62225#L149 assume !(0 != main_~p3~0); 62222#L154-1 assume !(0 != main_~p4~0); 62220#L159-1 assume !(0 != main_~p5~0); 62015#L164-1 assume !(0 != main_~p6~0); 62016#L169-1 assume !(0 != main_~p7~0); 62007#L174-1 assume !(0 != main_~p8~0); 62004#L179-1 assume !(0 != main_~p9~0); 61999#L184-1 assume !(0 != main_~p10~0); 61951#L189-1 assume !(0 != main_~p11~0); 61950#L194-1 assume !(0 != main_~p12~0); 62148#L199-1 assume !(0 != main_~p13~0); 62144#L204-1 assume 0 != main_~p14~0; 62141#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 61714#L209 [2019-10-22 09:01:04,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:04,717 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-10-22 09:01:04,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:04,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608955772] [2019-10-22 09:01:04,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:04,732 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:04,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:04,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1716972869, now seen corresponding path program 1 times [2019-10-22 09:01:04,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:04,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443319297] [2019-10-22 09:01:04,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:04,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443319297] [2019-10-22 09:01:04,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:04,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:04,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075310238] [2019-10-22 09:01:04,758 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:04,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:04,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:04,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:04,758 INFO L87 Difference]: Start difference. First operand 20225 states and 28929 transitions. cyclomatic complexity: 9216 Second operand 3 states. [2019-10-22 09:01:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:04,860 INFO L93 Difference]: Finished difference Result 39937 states and 56321 transitions. [2019-10-22 09:01:04,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:04,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39937 states and 56321 transitions. [2019-10-22 09:01:05,018 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2019-10-22 09:01:05,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39937 states to 39937 states and 56321 transitions. [2019-10-22 09:01:05,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39937 [2019-10-22 09:01:05,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39937 [2019-10-22 09:01:05,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39937 states and 56321 transitions. [2019-10-22 09:01:05,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:05,186 INFO L688 BuchiCegarLoop]: Abstraction has 39937 states and 56321 transitions. [2019-10-22 09:01:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39937 states and 56321 transitions. [2019-10-22 09:01:05,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39937 to 39937. [2019-10-22 09:01:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39937 states. [2019-10-22 09:01:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39937 states to 39937 states and 56321 transitions. [2019-10-22 09:01:05,950 INFO L711 BuchiCegarLoop]: Abstraction has 39937 states and 56321 transitions. [2019-10-22 09:01:05,950 INFO L591 BuchiCegarLoop]: Abstraction has 39937 states and 56321 transitions. [2019-10-22 09:01:05,950 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:01:05,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39937 states and 56321 transitions. [2019-10-22 09:01:06,064 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2019-10-22 09:01:06,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:06,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:06,065 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:01:06,065 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:06,066 INFO L791 eck$LassoCheckResult]: Stem: 121873#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 121874#L209 [2019-10-22 09:01:06,066 INFO L793 eck$LassoCheckResult]: Loop: 121874#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 122323#L53 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 122324#L86 assume !(0 != main_~p1~0); 122309#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 122310#L90-1 assume !(0 != main_~p3~0); 122295#L94-1 assume !(0 != main_~p4~0); 122297#L98-1 assume !(0 != main_~p5~0); 122530#L102-1 assume !(0 != main_~p6~0); 122527#L106-1 assume !(0 != main_~p7~0); 122525#L110-1 assume !(0 != main_~p8~0); 122523#L114-1 assume !(0 != main_~p9~0); 122466#L118-1 assume !(0 != main_~p10~0); 122464#L122-1 assume !(0 != main_~p11~0); 122460#L126-1 assume !(0 != main_~p12~0); 122457#L130-1 assume !(0 != main_~p13~0); 122456#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 122454#L138-1 assume !(0 != main_~p1~0); 122453#L144-1 assume 0 != main_~p2~0; 122452#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 122192#L149 assume !(0 != main_~p3~0); 122187#L154-1 assume !(0 != main_~p4~0); 122188#L159-1 assume !(0 != main_~p5~0); 122178#L164-1 assume !(0 != main_~p6~0); 122179#L169-1 assume !(0 != main_~p7~0); 122436#L174-1 assume !(0 != main_~p8~0); 122428#L179-1 assume !(0 != main_~p9~0); 122378#L184-1 assume !(0 != main_~p10~0); 122368#L189-1 assume !(0 != main_~p11~0); 122367#L194-1 assume !(0 != main_~p12~0); 122349#L199-1 assume !(0 != main_~p13~0); 122350#L204-1 assume 0 != main_~p14~0; 122335#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 121874#L209 [2019-10-22 09:01:06,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:06,066 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 11 times [2019-10-22 09:01:06,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:06,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448676206] [2019-10-22 09:01:06,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:06,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:06,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:06,073 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:06,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:06,073 INFO L82 PathProgramCache]: Analyzing trace with hash 583849721, now seen corresponding path program 1 times [2019-10-22 09:01:06,073 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:06,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647504792] [2019-10-22 09:01:06,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:06,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:06,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:06,089 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:06,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:06,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1609341720, now seen corresponding path program 1 times [2019-10-22 09:01:06,090 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:06,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185597836] [2019-10-22 09:01:06,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:06,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:06,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:06,103 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:06,221 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-22 09:01:06,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:06 BoogieIcfgContainer [2019-10-22 09:01:06,390 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:06,391 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:06,391 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:06,391 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:06,392 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:01" (3/4) ... [2019-10-22 09:01:06,395 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 09:01:06,449 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a82f6d32-ba1d-4fcd-a952-95a175a4090d/bin/uautomizer/witness.graphml [2019-10-22 09:01:06,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:06,451 INFO L168 Benchmark]: Toolchain (without parser) took 5290.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 944.5 MB in the beginning and 856.2 MB in the end (delta: 88.3 MB). Peak memory consumption was 310.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:06,454 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:06,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -204.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:06,455 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:06,455 INFO L168 Benchmark]: Boogie Preprocessor took 25.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:06,456 INFO L168 Benchmark]: RCFGBuilder took 427.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:06,456 INFO L168 Benchmark]: BuchiAutomizer took 4448.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 858.4 MB in the end (delta: 261.9 MB). Peak memory consumption was 329.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:06,456 INFO L168 Benchmark]: Witness Printer took 58.09 ms. Allocated memory is still 1.3 GB. Free memory was 858.4 MB in the beginning and 856.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:06,463 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -204.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 427.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4448.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 858.4 MB in the end (delta: 261.9 MB). Peak memory consumption was 329.5 MB. Max. memory is 11.5 GB. * Witness Printer took 58.09 ms. Allocated memory is still 1.3 GB. Free memory was 858.4 MB in the beginning and 856.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 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 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 39937 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 1.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had 39937 states and ocurred in iteration 10. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1073 SDtfs, 551 SDslu, 669 SDs, 0 SdLazy, 50 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 51]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=3, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f553d4b=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e767043=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c931012=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1de4c93d=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f11d86a=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c71796=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@588156c1=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@136ecd00=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c3a1cf=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53cf56e=0, p14=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25404eff=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@108992ec=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e675346=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a70dd18=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57361c67=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 51]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L49] int cond; Loop: [L51] COND TRUE 1 [L52] cond = __VERIFIER_nondet_int() [L53] COND FALSE !(cond == 0) [L56] lk1 = 0 [L58] lk2 = 0 [L60] lk3 = 0 [L62] lk4 = 0 [L64] lk5 = 0 [L66] lk6 = 0 [L68] lk7 = 0 [L70] lk8 = 0 [L72] lk9 = 0 [L74] lk10 = 0 [L76] lk11 = 0 [L78] lk12 = 0 [L80] lk13 = 0 [L82] lk14 = 0 [L86] COND FALSE !(p1 != 0) [L90] COND TRUE p2 != 0 [L91] lk2 = 1 [L94] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L102] COND FALSE !(p5 != 0) [L106] COND FALSE !(p6 != 0) [L110] COND FALSE !(p7 != 0) [L114] COND FALSE !(p8 != 0) [L118] COND FALSE !(p9 != 0) [L122] COND FALSE !(p10 != 0) [L126] COND FALSE !(p11 != 0) [L130] COND FALSE !(p12 != 0) [L134] COND FALSE !(p13 != 0) [L138] COND TRUE p14 != 0 [L139] lk14 = 1 [L144] COND FALSE !(p1 != 0) [L149] COND TRUE p2 != 0 [L150] COND FALSE !(lk2 != 1) [L151] lk2 = 0 [L154] COND FALSE !(p3 != 0) [L159] COND FALSE !(p4 != 0) [L164] COND FALSE !(p5 != 0) [L169] COND FALSE !(p6 != 0) [L174] COND FALSE !(p7 != 0) [L179] COND FALSE !(p8 != 0) [L184] COND FALSE !(p9 != 0) [L189] COND FALSE !(p10 != 0) [L194] COND FALSE !(p11 != 0) [L199] COND FALSE !(p12 != 0) [L204] COND FALSE !(p13 != 0) [L209] COND TRUE p14 != 0 [L210] COND FALSE !(lk14 != 1) [L211] lk14 = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...