./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/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 5107685577f81a5867811396b2c0a05eb5630c95 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-678e011 [2019-11-19 23:49:04,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:49:04,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:49:04,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:49:04,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:49:04,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:49:04,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:49:04,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:49:04,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:49:04,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:49:04,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:49:04,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:49:04,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:49:04,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:49:04,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:49:04,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:49:04,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:49:04,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:49:04,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:49:04,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:49:04,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:49:04,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:49:04,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:49:04,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:49:04,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:49:04,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:49:04,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:49:04,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:49:04,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:49:04,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:49:04,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:49:04,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:49:04,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:49:04,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:49:04,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:49:04,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:49:04,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:49:04,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:49:04,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:49:04,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:49:04,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:49:04,566 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-19 23:49:04,594 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:49:04,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:49:04,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:49:04,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:49:04,595 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:49:04,595 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 23:49:04,595 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 23:49:04,595 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 23:49:04,595 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 23:49:04,596 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 23:49:04,596 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 23:49:04,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:49:04,596 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:49:04,596 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 23:49:04,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:49:04,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:49:04,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:49:04,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 23:49:04,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 23:49:04,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 23:49:04,597 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:49:04,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:49:04,597 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 23:49:04,597 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:49:04,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 23:49:04,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:49:04,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:49:04,598 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 23:49:04,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:49:04,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:49:04,598 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 23:49:04,599 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 23:49:04,599 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/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2019-11-19 23:49:04,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:49:04,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:49:04,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:49:04,771 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:49:04,771 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:49:04,772 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_9.c [2019-11-19 23:49:04,841 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/bin/uautomizer/data/9484758b1/94fa2f65a79e4c7ca969d8cabc5c90fa/FLAG9fd38b0ad [2019-11-19 23:49:05,305 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:49:05,306 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/sv-benchmarks/c/locks/test_locks_9.c [2019-11-19 23:49:05,317 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/bin/uautomizer/data/9484758b1/94fa2f65a79e4c7ca969d8cabc5c90fa/FLAG9fd38b0ad [2019-11-19 23:49:05,675 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/bin/uautomizer/data/9484758b1/94fa2f65a79e4c7ca969d8cabc5c90fa [2019-11-19 23:49:05,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:49:05,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:49:05,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:49:05,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:49:05,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:49:05,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:49:05" (1/1) ... [2019-11-19 23:49:05,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774d25d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:49:05, skipping insertion in model container [2019-11-19 23:49:05,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:49:05" (1/1) ... [2019-11-19 23:49:05,694 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:49:05,714 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:49:06,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:49:06,059 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:49:06,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:49:06,097 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:49:06,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:49:06 WrapperNode [2019-11-19 23:49:06,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:49:06,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:49:06,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:49:06,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:49:06,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:49:06" (1/1) ... [2019-11-19 23:49:06,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:49:06" (1/1) ... [2019-11-19 23:49:06,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:49:06,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:49:06,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:49:06,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:49:06,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:49:06" (1/1) ... [2019-11-19 23:49:06,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:49:06" (1/1) ... [2019-11-19 23:49:06,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:49:06" (1/1) ... [2019-11-19 23:49:06,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:49:06" (1/1) ... [2019-11-19 23:49:06,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:49:06" (1/1) ... [2019-11-19 23:49:06,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:49:06" (1/1) ... [2019-11-19 23:49:06,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:49:06" (1/1) ... [2019-11-19 23:49:06,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:49:06,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:49:06,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:49:06,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:49:06,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:49:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/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-11-19 23:49:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:49:06,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:49:06,670 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:49:06,670 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 23:49:06,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:49:06 BoogieIcfgContainer [2019-11-19 23:49:06,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:49:06,672 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 23:49:06,672 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 23:49:06,676 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 23:49:06,677 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 23:49:06,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 11:49:05" (1/3) ... [2019-11-19 23:49:06,678 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16d0ded8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 11:49:06, skipping insertion in model container [2019-11-19 23:49:06,678 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 23:49:06,678 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:49:06" (2/3) ... [2019-11-19 23:49:06,679 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16d0ded8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 11:49:06, skipping insertion in model container [2019-11-19 23:49:06,679 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 23:49:06,679 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:49:06" (3/3) ... [2019-11-19 23:49:06,681 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_9.c [2019-11-19 23:49:06,729 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 23:49:06,729 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 23:49:06,729 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 23:49:06,730 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:49:06,730 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:49:06,730 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 23:49:06,730 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:49:06,730 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 23:49:06,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2019-11-19 23:49:06,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-11-19 23:49:06,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:49:06,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:49:06,775 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:49:06,775 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] [2019-11-19 23:49:06,776 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 23:49:06,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2019-11-19 23:49:06,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-11-19 23:49:06,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:49:06,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:49:06,780 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:49:06,781 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] [2019-11-19 23:49:06,789 INFO L794 eck$LassoCheckResult]: Stem: 32#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_~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_~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;havoc main_~cond~0; 31#L139-1true [2019-11-19 23:49:06,790 INFO L796 eck$LassoCheckResult]: Loop: 31#L139-1true assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 4#L38true 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; 27#L61true assume 0 != main_~p1~0;main_~lk1~0 := 1; 24#L61-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 11#L65-1true assume !(0 != main_~p3~0); 20#L69-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 8#L73-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 34#L77-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 23#L81-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 30#L85-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 17#L89-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 5#L93-1true assume !(0 != main_~p1~0); 35#L99-1true assume !(0 != main_~p2~0); 6#L104-1true assume !(0 != main_~p3~0); 14#L109-1true assume !(0 != main_~p4~0); 26#L114-1true assume !(0 != main_~p5~0); 33#L119-1true assume !(0 != main_~p6~0); 3#L124-1true assume !(0 != main_~p7~0); 12#L129-1true assume !(0 != main_~p8~0); 22#L134-1true assume !(0 != main_~p9~0); 31#L139-1true [2019-11-19 23:49:06,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:06,796 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-19 23:49:06,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:06,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283618444] [2019-11-19 23:49:06,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:06,893 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:49:06,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:06,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1889319211, now seen corresponding path program 1 times [2019-11-19 23:49:06,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:06,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227029979] [2019-11-19 23:49:06,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:49:06,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227029979] [2019-11-19 23:49:06,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:49:06,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:49:06,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447137898] [2019-11-19 23:49:06,986 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:49:06,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:49:07,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:49:07,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:49:07,005 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-11-19 23:49:07,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:07,048 INFO L93 Difference]: Finished difference Result 68 states and 117 transitions. [2019-11-19 23:49:07,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:49:07,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 117 transitions. [2019-11-19 23:49:07,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2019-11-19 23:49:07,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 58 states and 92 transitions. [2019-11-19 23:49:07,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-19 23:49:07,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2019-11-19 23:49:07,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 92 transitions. [2019-11-19 23:49:07,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:49:07,062 INFO L688 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2019-11-19 23:49:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 92 transitions. [2019-11-19 23:49:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-19 23:49:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-19 23:49:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 92 transitions. [2019-11-19 23:49:07,092 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2019-11-19 23:49:07,092 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2019-11-19 23:49:07,092 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 23:49:07,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 92 transitions. [2019-11-19 23:49:07,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2019-11-19 23:49:07,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:49:07,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:49:07,096 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:49:07,096 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] [2019-11-19 23:49:07,096 INFO L794 eck$LassoCheckResult]: Stem: 143#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_~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_~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;havoc main_~cond~0; 144#L139-1 [2019-11-19 23:49:07,096 INFO L796 eck$LassoCheckResult]: Loop: 144#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 155#L38 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; 154#L61 assume !(0 != main_~p1~0); 139#L61-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 128#L65-1 assume !(0 != main_~p3~0); 129#L69-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 124#L73-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 125#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 150#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 149#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 148#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 147#L93-1 assume !(0 != main_~p1~0); 146#L99-1 assume !(0 != main_~p2~0); 119#L104-1 assume !(0 != main_~p3~0); 120#L109-1 assume !(0 != main_~p4~0); 127#L114-1 assume !(0 != main_~p5~0); 135#L119-1 assume !(0 != main_~p6~0); 112#L124-1 assume !(0 != main_~p7~0); 113#L129-1 assume !(0 != main_~p8~0); 157#L134-1 assume !(0 != main_~p9~0); 144#L139-1 [2019-11-19 23:49:07,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:07,097 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-19 23:49:07,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:07,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260197448] [2019-11-19 23:49:07,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:07,110 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:49:07,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:07,110 INFO L82 PathProgramCache]: Analyzing trace with hash 411503379, now seen corresponding path program 1 times [2019-11-19 23:49:07,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:07,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188323060] [2019-11-19 23:49:07,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:07,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-11-19 23:49:07,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188323060] [2019-11-19 23:49:07,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:49:07,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:49:07,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779100239] [2019-11-19 23:49:07,166 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:49:07,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:49:07,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:49:07,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:49:07,167 INFO L87 Difference]: Start difference. First operand 58 states and 92 transitions. cyclomatic complexity: 36 Second operand 3 states. [2019-11-19 23:49:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:07,201 INFO L93 Difference]: Finished difference Result 113 states and 177 transitions. [2019-11-19 23:49:07,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:49:07,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 177 transitions. [2019-11-19 23:49:07,206 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2019-11-19 23:49:07,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 113 states and 177 transitions. [2019-11-19 23:49:07,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2019-11-19 23:49:07,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2019-11-19 23:49:07,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 177 transitions. [2019-11-19 23:49:07,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:49:07,211 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2019-11-19 23:49:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 177 transitions. [2019-11-19 23:49:07,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-19 23:49:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-19 23:49:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 177 transitions. [2019-11-19 23:49:07,225 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2019-11-19 23:49:07,225 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2019-11-19 23:49:07,226 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 23:49:07,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 177 transitions. [2019-11-19 23:49:07,228 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2019-11-19 23:49:07,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:49:07,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:49:07,229 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:49:07,230 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] [2019-11-19 23:49:07,230 INFO L794 eck$LassoCheckResult]: Stem: 323#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_~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_~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;havoc main_~cond~0; 324#L139-1 [2019-11-19 23:49:07,230 INFO L796 eck$LassoCheckResult]: Loop: 324#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 292#L38 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; 293#L61 assume !(0 != main_~p1~0); 359#L61-2 assume !(0 != main_~p2~0); 358#L65-1 assume !(0 != main_~p3~0); 357#L69-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 356#L73-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 355#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 354#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 353#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 352#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 350#L93-1 assume !(0 != main_~p1~0); 349#L99-1 assume !(0 != main_~p2~0); 347#L104-1 assume !(0 != main_~p3~0); 346#L109-1 assume !(0 != main_~p4~0); 341#L114-1 assume !(0 != main_~p5~0); 339#L119-1 assume !(0 != main_~p6~0); 338#L124-1 assume !(0 != main_~p7~0); 333#L129-1 assume !(0 != main_~p8~0); 331#L134-1 assume !(0 != main_~p9~0); 324#L139-1 [2019-11-19 23:49:07,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:07,231 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-19 23:49:07,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:07,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500704669] [2019-11-19 23:49:07,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:07,241 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:49:07,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:07,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1176844523, now seen corresponding path program 1 times [2019-11-19 23:49:07,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:07,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752344418] [2019-11-19 23:49:07,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:49:07,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752344418] [2019-11-19 23:49:07,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:49:07,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:49:07,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501977889] [2019-11-19 23:49:07,280 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:49:07,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:49:07,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:49:07,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:49:07,281 INFO L87 Difference]: Start difference. First operand 113 states and 177 transitions. cyclomatic complexity: 68 Second operand 3 states. [2019-11-19 23:49:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:07,310 INFO L93 Difference]: Finished difference Result 221 states and 341 transitions. [2019-11-19 23:49:07,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:49:07,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 341 transitions. [2019-11-19 23:49:07,316 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2019-11-19 23:49:07,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 221 states and 341 transitions. [2019-11-19 23:49:07,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2019-11-19 23:49:07,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2019-11-19 23:49:07,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 341 transitions. [2019-11-19 23:49:07,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:49:07,327 INFO L688 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2019-11-19 23:49:07,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 341 transitions. [2019-11-19 23:49:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-11-19 23:49:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-19 23:49:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 341 transitions. [2019-11-19 23:49:07,367 INFO L711 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2019-11-19 23:49:07,367 INFO L591 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2019-11-19 23:49:07,367 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 23:49:07,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 341 transitions. [2019-11-19 23:49:07,370 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2019-11-19 23:49:07,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:49:07,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:49:07,371 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:49:07,371 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] [2019-11-19 23:49:07,371 INFO L794 eck$LassoCheckResult]: Stem: 663#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_~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_~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;havoc main_~cond~0; 664#L139-1 [2019-11-19 23:49:07,372 INFO L796 eck$LassoCheckResult]: Loop: 664#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 724#L38 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; 714#L61 assume !(0 != main_~p1~0); 716#L61-2 assume !(0 != main_~p2~0); 707#L65-1 assume !(0 != main_~p3~0); 708#L69-1 assume !(0 != main_~p4~0); 770#L73-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 769#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 768#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 767#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 766#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 765#L93-1 assume !(0 != main_~p1~0); 762#L99-1 assume !(0 != main_~p2~0); 760#L104-1 assume !(0 != main_~p3~0); 756#L109-1 assume !(0 != main_~p4~0); 757#L114-1 assume !(0 != main_~p5~0); 752#L119-1 assume !(0 != main_~p6~0); 751#L124-1 assume !(0 != main_~p7~0); 746#L129-1 assume !(0 != main_~p8~0); 745#L134-1 assume !(0 != main_~p9~0); 664#L139-1 [2019-11-19 23:49:07,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-19 23:49:07,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:07,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146456518] [2019-11-19 23:49:07,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:07,382 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:49:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:07,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1838259095, now seen corresponding path program 1 times [2019-11-19 23:49:07,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:07,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886240822] [2019-11-19 23:49:07,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:49:07,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886240822] [2019-11-19 23:49:07,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:49:07,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:49:07,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828115211] [2019-11-19 23:49:07,423 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:49:07,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:49:07,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:49:07,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:49:07,424 INFO L87 Difference]: Start difference. First operand 221 states and 341 transitions. cyclomatic complexity: 128 Second operand 3 states. [2019-11-19 23:49:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:07,453 INFO L93 Difference]: Finished difference Result 433 states and 657 transitions. [2019-11-19 23:49:07,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:49:07,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 657 transitions. [2019-11-19 23:49:07,458 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2019-11-19 23:49:07,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 433 states and 657 transitions. [2019-11-19 23:49:07,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 433 [2019-11-19 23:49:07,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 433 [2019-11-19 23:49:07,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 657 transitions. [2019-11-19 23:49:07,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:49:07,467 INFO L688 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2019-11-19 23:49:07,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 657 transitions. [2019-11-19 23:49:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2019-11-19 23:49:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-19 23:49:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 657 transitions. [2019-11-19 23:49:07,489 INFO L711 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2019-11-19 23:49:07,489 INFO L591 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2019-11-19 23:49:07,489 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 23:49:07,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 433 states and 657 transitions. [2019-11-19 23:49:07,493 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2019-11-19 23:49:07,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:49:07,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:49:07,493 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:49:07,494 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] [2019-11-19 23:49:07,494 INFO L794 eck$LassoCheckResult]: Stem: 1324#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_~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_~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;havoc main_~cond~0; 1325#L139-1 [2019-11-19 23:49:07,494 INFO L796 eck$LassoCheckResult]: Loop: 1325#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 1372#L38 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; 1370#L61 assume !(0 != main_~p1~0); 1366#L61-2 assume !(0 != main_~p2~0); 1364#L65-1 assume !(0 != main_~p3~0); 1360#L69-1 assume !(0 != main_~p4~0); 1356#L73-1 assume !(0 != main_~p5~0); 1354#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1352#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1350#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1348#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1346#L93-1 assume !(0 != main_~p1~0); 1340#L99-1 assume !(0 != main_~p2~0); 1342#L104-1 assume !(0 != main_~p3~0); 1397#L109-1 assume !(0 != main_~p4~0); 1393#L114-1 assume !(0 != main_~p5~0); 1390#L119-1 assume !(0 != main_~p6~0); 1385#L124-1 assume !(0 != main_~p7~0); 1382#L129-1 assume !(0 != main_~p8~0); 1376#L134-1 assume !(0 != main_~p9~0); 1325#L139-1 [2019-11-19 23:49:07,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:07,495 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-19 23:49:07,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:07,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480399930] [2019-11-19 23:49:07,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:07,504 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:49:07,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:07,504 INFO L82 PathProgramCache]: Analyzing trace with hash 827141845, now seen corresponding path program 1 times [2019-11-19 23:49:07,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:07,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265475056] [2019-11-19 23:49:07,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:49:07,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265475056] [2019-11-19 23:49:07,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:49:07,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:49:07,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366899135] [2019-11-19 23:49:07,538 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:49:07,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:49:07,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:49:07,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:49:07,539 INFO L87 Difference]: Start difference. First operand 433 states and 657 transitions. cyclomatic complexity: 240 Second operand 3 states. [2019-11-19 23:49:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:07,565 INFO L93 Difference]: Finished difference Result 849 states and 1265 transitions. [2019-11-19 23:49:07,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:49:07,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 849 states and 1265 transitions. [2019-11-19 23:49:07,578 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2019-11-19 23:49:07,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 849 states to 849 states and 1265 transitions. [2019-11-19 23:49:07,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 849 [2019-11-19 23:49:07,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 849 [2019-11-19 23:49:07,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 849 states and 1265 transitions. [2019-11-19 23:49:07,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:49:07,590 INFO L688 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2019-11-19 23:49:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states and 1265 transitions. [2019-11-19 23:49:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2019-11-19 23:49:07,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-11-19 23:49:07,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1265 transitions. [2019-11-19 23:49:07,615 INFO L711 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2019-11-19 23:49:07,615 INFO L591 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2019-11-19 23:49:07,615 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 23:49:07,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 849 states and 1265 transitions. [2019-11-19 23:49:07,622 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2019-11-19 23:49:07,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:49:07,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:49:07,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:49:07,623 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] [2019-11-19 23:49:07,623 INFO L794 eck$LassoCheckResult]: Stem: 2614#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_~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_~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;havoc main_~cond~0; 2615#L139-1 [2019-11-19 23:49:07,624 INFO L796 eck$LassoCheckResult]: Loop: 2615#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 2769#L38 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; 2767#L61 assume !(0 != main_~p1~0); 2764#L61-2 assume !(0 != main_~p2~0); 2765#L65-1 assume !(0 != main_~p3~0); 2746#L69-1 assume !(0 != main_~p4~0); 2748#L73-1 assume !(0 != main_~p5~0); 2732#L77-1 assume !(0 != main_~p6~0); 2734#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2718#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2719#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2700#L93-1 assume !(0 != main_~p1~0); 2702#L99-1 assume !(0 != main_~p2~0); 2791#L104-1 assume !(0 != main_~p3~0); 2788#L109-1 assume !(0 != main_~p4~0); 2786#L114-1 assume !(0 != main_~p5~0); 2784#L119-1 assume !(0 != main_~p6~0); 2780#L124-1 assume !(0 != main_~p7~0); 2777#L129-1 assume !(0 != main_~p8~0); 2773#L134-1 assume !(0 != main_~p9~0); 2615#L139-1 [2019-11-19 23:49:07,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:07,624 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-19 23:49:07,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:07,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127387999] [2019-11-19 23:49:07,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:07,649 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:49:07,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:07,650 INFO L82 PathProgramCache]: Analyzing trace with hash 240335831, now seen corresponding path program 1 times [2019-11-19 23:49:07,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:07,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112220038] [2019-11-19 23:49:07,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:07,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:49:07,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112220038] [2019-11-19 23:49:07,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:49:07,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:49:07,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431240876] [2019-11-19 23:49:07,691 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:49:07,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:49:07,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:49:07,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:49:07,692 INFO L87 Difference]: Start difference. First operand 849 states and 1265 transitions. cyclomatic complexity: 448 Second operand 3 states. [2019-11-19 23:49:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:07,729 INFO L93 Difference]: Finished difference Result 1665 states and 2433 transitions. [2019-11-19 23:49:07,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:49:07,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1665 states and 2433 transitions. [2019-11-19 23:49:07,752 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2019-11-19 23:49:07,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1665 states to 1665 states and 2433 transitions. [2019-11-19 23:49:07,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1665 [2019-11-19 23:49:07,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1665 [2019-11-19 23:49:07,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1665 states and 2433 transitions. [2019-11-19 23:49:07,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:49:07,772 INFO L688 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2019-11-19 23:49:07,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states and 2433 transitions. [2019-11-19 23:49:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2019-11-19 23:49:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-11-19 23:49:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2433 transitions. [2019-11-19 23:49:07,814 INFO L711 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2019-11-19 23:49:07,814 INFO L591 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2019-11-19 23:49:07,814 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 23:49:07,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1665 states and 2433 transitions. [2019-11-19 23:49:07,826 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2019-11-19 23:49:07,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:49:07,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:49:07,828 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:49:07,828 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] [2019-11-19 23:49:07,828 INFO L794 eck$LassoCheckResult]: Stem: 5134#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_~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_~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;havoc main_~cond~0; 5135#L139-1 [2019-11-19 23:49:07,828 INFO L796 eck$LassoCheckResult]: Loop: 5135#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 5321#L38 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; 5319#L61 assume !(0 != main_~p1~0); 5317#L61-2 assume !(0 != main_~p2~0); 5316#L65-1 assume !(0 != main_~p3~0); 5313#L69-1 assume !(0 != main_~p4~0); 5309#L73-1 assume !(0 != main_~p5~0); 5305#L77-1 assume !(0 != main_~p6~0); 5306#L81-1 assume !(0 != main_~p7~0); 5284#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5285#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5270#L93-1 assume !(0 != main_~p1~0); 5271#L99-1 assume !(0 != main_~p2~0); 5245#L104-1 assume !(0 != main_~p3~0); 5244#L109-1 assume !(0 != main_~p4~0); 5225#L114-1 assume !(0 != main_~p5~0); 5227#L119-1 assume !(0 != main_~p6~0); 5326#L124-1 assume !(0 != main_~p7~0); 5325#L129-1 assume !(0 != main_~p8~0); 5323#L134-1 assume !(0 != main_~p9~0); 5135#L139-1 [2019-11-19 23:49:07,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:07,829 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-19 23:49:07,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:07,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692855523] [2019-11-19 23:49:07,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:07,853 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:49:07,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:07,854 INFO L82 PathProgramCache]: Analyzing trace with hash 498501269, now seen corresponding path program 1 times [2019-11-19 23:49:07,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:07,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017048860] [2019-11-19 23:49:07,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:49:07,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017048860] [2019-11-19 23:49:07,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:49:07,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:49:07,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023878301] [2019-11-19 23:49:07,898 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:49:07,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:49:07,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:49:07,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:49:07,899 INFO L87 Difference]: Start difference. First operand 1665 states and 2433 transitions. cyclomatic complexity: 832 Second operand 3 states. [2019-11-19 23:49:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:07,945 INFO L93 Difference]: Finished difference Result 3265 states and 4673 transitions. [2019-11-19 23:49:07,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:49:07,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3265 states and 4673 transitions. [2019-11-19 23:49:07,985 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2019-11-19 23:49:08,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3265 states to 3265 states and 4673 transitions. [2019-11-19 23:49:08,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3265 [2019-11-19 23:49:08,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3265 [2019-11-19 23:49:08,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3265 states and 4673 transitions. [2019-11-19 23:49:08,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:49:08,025 INFO L688 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2019-11-19 23:49:08,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states and 4673 transitions. [2019-11-19 23:49:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3265. [2019-11-19 23:49:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3265 states. [2019-11-19 23:49:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3265 states to 3265 states and 4673 transitions. [2019-11-19 23:49:08,106 INFO L711 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2019-11-19 23:49:08,106 INFO L591 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2019-11-19 23:49:08,107 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 23:49:08,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3265 states and 4673 transitions. [2019-11-19 23:49:08,128 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2019-11-19 23:49:08,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:49:08,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:49:08,129 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:49:08,130 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] [2019-11-19 23:49:08,130 INFO L794 eck$LassoCheckResult]: Stem: 10069#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_~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_~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;havoc main_~cond~0; 10070#L139-1 [2019-11-19 23:49:08,134 INFO L796 eck$LassoCheckResult]: Loop: 10070#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 10336#L38 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; 10334#L61 assume !(0 != main_~p1~0); 10332#L61-2 assume !(0 != main_~p2~0); 10329#L65-1 assume !(0 != main_~p3~0); 10326#L69-1 assume !(0 != main_~p4~0); 10322#L73-1 assume !(0 != main_~p5~0); 10318#L77-1 assume !(0 != main_~p6~0); 10319#L81-1 assume !(0 != main_~p7~0); 10299#L85-1 assume !(0 != main_~p8~0); 10301#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 10284#L93-1 assume !(0 != main_~p1~0); 10286#L99-1 assume !(0 != main_~p2~0); 10242#L104-1 assume !(0 != main_~p3~0); 10241#L109-1 assume !(0 != main_~p4~0); 10225#L114-1 assume !(0 != main_~p5~0); 10227#L119-1 assume !(0 != main_~p6~0); 10342#L124-1 assume !(0 != main_~p7~0); 10340#L129-1 assume !(0 != main_~p8~0); 10339#L134-1 assume !(0 != main_~p9~0); 10070#L139-1 [2019-11-19 23:49:08,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:08,134 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-19 23:49:08,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:08,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733827356] [2019-11-19 23:49:08,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:08,156 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:49:08,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:08,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1199565847, now seen corresponding path program 1 times [2019-11-19 23:49:08,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:08,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802635574] [2019-11-19 23:49:08,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:49:08,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802635574] [2019-11-19 23:49:08,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:49:08,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:49:08,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866774343] [2019-11-19 23:49:08,188 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:49:08,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:49:08,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:49:08,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:49:08,188 INFO L87 Difference]: Start difference. First operand 3265 states and 4673 transitions. cyclomatic complexity: 1536 Second operand 3 states. [2019-11-19 23:49:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:08,241 INFO L93 Difference]: Finished difference Result 6401 states and 8961 transitions. [2019-11-19 23:49:08,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:49:08,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6401 states and 8961 transitions. [2019-11-19 23:49:08,295 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2019-11-19 23:49:08,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6401 states to 6401 states and 8961 transitions. [2019-11-19 23:49:08,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6401 [2019-11-19 23:49:08,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6401 [2019-11-19 23:49:08,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6401 states and 8961 transitions. [2019-11-19 23:49:08,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:49:08,370 INFO L688 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2019-11-19 23:49:08,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6401 states and 8961 transitions. [2019-11-19 23:49:08,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6401 to 6401. [2019-11-19 23:49:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6401 states. [2019-11-19 23:49:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 8961 transitions. [2019-11-19 23:49:08,529 INFO L711 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2019-11-19 23:49:08,529 INFO L591 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2019-11-19 23:49:08,529 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-19 23:49:08,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6401 states and 8961 transitions. [2019-11-19 23:49:08,559 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2019-11-19 23:49:08,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:49:08,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:49:08,560 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:49:08,560 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] [2019-11-19 23:49:08,560 INFO L794 eck$LassoCheckResult]: Stem: 19746#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_~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_~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;havoc main_~cond~0; 19747#L139-1 [2019-11-19 23:49:08,561 INFO L796 eck$LassoCheckResult]: Loop: 19747#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 20162#L38 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; 20160#L61 assume !(0 != main_~p1~0); 20158#L61-2 assume !(0 != main_~p2~0); 20157#L65-1 assume !(0 != main_~p3~0); 20029#L69-1 assume !(0 != main_~p4~0); 20031#L73-1 assume !(0 != main_~p5~0); 20146#L77-1 assume !(0 != main_~p6~0); 20142#L81-1 assume !(0 != main_~p7~0); 20138#L85-1 assume !(0 != main_~p8~0); 20090#L89-1 assume !(0 != main_~p9~0); 20092#L93-1 assume !(0 != main_~p1~0); 20079#L99-1 assume !(0 != main_~p2~0); 20081#L104-1 assume !(0 != main_~p3~0); 20073#L109-1 assume !(0 != main_~p4~0); 20074#L114-1 assume !(0 != main_~p5~0); 20068#L119-1 assume !(0 != main_~p6~0); 20069#L124-1 assume !(0 != main_~p7~0); 20175#L129-1 assume !(0 != main_~p8~0); 20089#L134-1 assume !(0 != main_~p9~0); 19747#L139-1 [2019-11-19 23:49:08,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:08,561 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-19 23:49:08,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:08,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246364463] [2019-11-19 23:49:08,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:08,568 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:49:08,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:08,569 INFO L82 PathProgramCache]: Analyzing trace with hash 806538837, now seen corresponding path program 1 times [2019-11-19 23:49:08,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:08,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921813541] [2019-11-19 23:49:08,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:08,584 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:49:08,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:08,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1231517452, now seen corresponding path program 1 times [2019-11-19 23:49:08,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:08,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510569595] [2019-11-19 23:49:08,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:49:08,598 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:49:08,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 11:49:08 BoogieIcfgContainer [2019-11-19 23:49:08,806 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 23:49:08,807 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:49:08,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:49:08,807 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:49:08,808 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:49:06" (3/4) ... [2019-11-19 23:49:08,812 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-19 23:49:08,890 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8c3fa079-abed-4e12-9521-1b82c0034df7/bin/uautomizer/witness.graphml [2019-11-19 23:49:08,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:49:08,894 INFO L168 Benchmark]: Toolchain (without parser) took 3213.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 951.4 MB in the beginning and 854.1 MB in the end (delta: 97.3 MB). Peak memory consumption was 241.5 MB. Max. memory is 11.5 GB. [2019-11-19 23:49:08,894 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:49:08,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:49:08,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.83 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:49:08,896 INFO L168 Benchmark]: Boogie Preprocessor took 40.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:49:08,896 INFO L168 Benchmark]: RCFGBuilder took 492.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:49:08,897 INFO L168 Benchmark]: BuchiAutomizer took 2134.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 860.9 MB in the end (delta: 244.6 MB). Peak memory consumption was 244.6 MB. Max. memory is 11.5 GB. [2019-11-19 23:49:08,897 INFO L168 Benchmark]: Witness Printer took 83.77 ms. Allocated memory is still 1.2 GB. Free memory was 860.9 MB in the beginning and 854.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:49:08,900 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 418.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.83 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.33 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. * RCFGBuilder took 492.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2134.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 860.9 MB in the end (delta: 244.6 MB). Peak memory consumption was 244.6 MB. Max. memory is 11.5 GB. * Witness Printer took 83.77 ms. Allocated memory is still 1.2 GB. Free memory was 860.9 MB in the beginning and 854.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6401 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 6401 states and ocurred in iteration 8. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 575 SDtfs, 301 SDslu, 348 SDs, 0 SdLazy, 40 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI8 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: 36]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44412ac7=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@722dcbbf=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46dd2b4b=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38e59ce2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1304bbd3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3350f29b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50d7aeb3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49dc42d7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40cc1707=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59174e6c=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 36]: 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; [L34] int cond; Loop: [L36] COND TRUE 1 [L37] cond = __VERIFIER_nondet_int() [L38] COND FALSE !(cond == 0) [L41] lk1 = 0 [L43] lk2 = 0 [L45] lk3 = 0 [L47] lk4 = 0 [L49] lk5 = 0 [L51] lk6 = 0 [L53] lk7 = 0 [L55] lk8 = 0 [L57] lk9 = 0 [L61] COND FALSE !(p1 != 0) [L65] COND FALSE !(p2 != 0) [L69] COND FALSE !(p3 != 0) [L73] COND FALSE !(p4 != 0) [L77] COND FALSE !(p5 != 0) [L81] COND FALSE !(p6 != 0) [L85] COND FALSE !(p7 != 0) [L89] COND FALSE !(p8 != 0) [L93] COND FALSE !(p9 != 0) [L99] COND FALSE !(p1 != 0) [L104] COND FALSE !(p2 != 0) [L109] COND FALSE !(p3 != 0) [L114] COND FALSE !(p4 != 0) [L119] COND FALSE !(p5 != 0) [L124] COND FALSE !(p6 != 0) [L129] COND FALSE !(p7 != 0) [L134] COND FALSE !(p8 != 0) [L139] COND FALSE !(p9 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...