./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 08:42:20,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:42:20,073 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:42:20,080 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:42:20,080 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:42:20,081 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:42:20,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:42:20,083 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:42:20,084 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:42:20,085 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:42:20,085 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:42:20,085 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:42:20,086 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:42:20,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:42:20,088 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:42:20,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:42:20,089 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:42:20,090 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:42:20,091 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:42:20,092 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:42:20,093 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:42:20,094 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:42:20,095 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:42:20,095 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:42:20,096 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:42:20,096 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:42:20,097 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:42:20,097 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:42:20,098 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:42:20,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:42:20,099 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:42:20,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:42:20,099 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:42:20,100 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:42:20,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:42:20,101 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:42:20,101 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 08:42:20,111 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:42:20,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:42:20,112 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:42:20,112 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:42:20,112 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:42:20,113 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 08:42:20,113 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 08:42:20,113 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 08:42:20,113 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 08:42:20,113 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 08:42:20,113 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 08:42:20,113 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:42:20,113 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:42:20,114 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 08:42:20,114 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:42:20,114 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:42:20,114 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:42:20,114 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 08:42:20,114 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 08:42:20,114 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 08:42:20,114 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:42:20,115 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:42:20,115 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 08:42:20,115 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:42:20,115 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 08:42:20,115 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:42:20,115 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:42:20,115 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 08:42:20,115 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:42:20,116 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 08:42:20,116 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 08:42:20,116 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 08:42:20,117 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2018-11-23 08:42:20,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:42:20,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:42:20,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:42:20,152 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:42:20,152 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:42:20,153 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 08:42:20,190 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/bin-2019/uautomizer/data/9d19989a4/e75cb7de00464c2c8a5a401336cb7708/FLAG00067ac9e [2018-11-23 08:42:20,526 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:42:20,526 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 08:42:20,533 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/bin-2019/uautomizer/data/9d19989a4/e75cb7de00464c2c8a5a401336cb7708/FLAG00067ac9e [2018-11-23 08:42:20,952 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/bin-2019/uautomizer/data/9d19989a4/e75cb7de00464c2c8a5a401336cb7708 [2018-11-23 08:42:20,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:42:20,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:42:20,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:42:20,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:42:20,967 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:42:20,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:42:20" (1/1) ... [2018-11-23 08:42:20,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e42f8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:42:20, skipping insertion in model container [2018-11-23 08:42:20,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:42:20" (1/1) ... [2018-11-23 08:42:20,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:42:20,996 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:42:21,147 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:42:21,151 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:42:21,177 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:42:21,189 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:42:21,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:42:21 WrapperNode [2018-11-23 08:42:21,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:42:21,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:42:21,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:42:21,190 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:42:21,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:42:21" (1/1) ... [2018-11-23 08:42:21,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:42:21" (1/1) ... [2018-11-23 08:42:21,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:42:21,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:42:21,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:42:21,223 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:42:21,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:42:21" (1/1) ... [2018-11-23 08:42:21,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:42:21" (1/1) ... [2018-11-23 08:42:21,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:42:21" (1/1) ... [2018-11-23 08:42:21,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:42:21" (1/1) ... [2018-11-23 08:42:21,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:42:21" (1/1) ... [2018-11-23 08:42:21,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:42:21" (1/1) ... [2018-11-23 08:42:21,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:42:21" (1/1) ... [2018-11-23 08:42:21,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:42:21,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:42:21,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:42:21,247 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:42:21,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:42:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:42:21,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:42:21,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:42:21,631 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:42:21,631 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 08:42:21,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:42:21 BoogieIcfgContainer [2018-11-23 08:42:21,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:42:21,632 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 08:42:21,632 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 08:42:21,636 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 08:42:21,637 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:42:21,637 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 08:42:20" (1/3) ... [2018-11-23 08:42:21,638 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@314dfa38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 08:42:21, skipping insertion in model container [2018-11-23 08:42:21,638 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:42:21,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:42:21" (2/3) ... [2018-11-23 08:42:21,638 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@314dfa38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 08:42:21, skipping insertion in model container [2018-11-23 08:42:21,638 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:42:21,639 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:42:21" (3/3) ... [2018-11-23 08:42:21,640 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 08:42:21,682 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:42:21,682 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 08:42:21,682 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 08:42:21,683 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 08:42:21,683 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:42:21,683 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:42:21,683 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 08:42:21,683 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:42:21,683 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 08:42:21,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2018-11-23 08:42:21,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-23 08:42:21,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:42:21,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:42:21,718 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 08:42:21,718 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:42:21,718 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 08:42:21,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2018-11-23 08:42:21,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-23 08:42:21,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:42:21,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:42:21,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 08:42:21,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:42:21,727 INFO L794 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; 14#L181-1true [2018-11-23 08:42:21,728 INFO L796 eck$LassoCheckResult]: Loop: 14#L181-1true assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 3#L47true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 22#L76true assume 0 != main_~p1~0;main_~lk1~0 := 1; 17#L76-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 4#L80-1true assume !(0 != main_~p3~0); 11#L84-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 44#L88-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 33#L92-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 15#L96-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 28#L100-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 8#L104-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 41#L108-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 30#L112-1true assume !(0 != main_~p11~0); 37#L116-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 24#L120-1true assume !(0 != main_~p1~0); 9#L126-1true assume !(0 != main_~p2~0); 25#L131-1true assume !(0 != main_~p3~0); 35#L136-1true assume !(0 != main_~p4~0); 42#L141-1true assume !(0 != main_~p5~0); 6#L146-1true assume !(0 != main_~p6~0); 20#L151-1true assume !(0 != main_~p7~0); 34#L156-1true assume !(0 != main_~p8~0); 40#L161-1true assume !(0 != main_~p9~0); 5#L166-1true assume !(0 != main_~p10~0); 18#L171-1true assume !(0 != main_~p11~0); 31#L176-1true assume !(0 != main_~p12~0); 14#L181-1true [2018-11-23 08:42:21,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:21,733 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-23 08:42:21,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:21,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:21,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:21,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:42:21,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:21,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:21,810 INFO L82 PathProgramCache]: Analyzing trace with hash -708087768, now seen corresponding path program 1 times [2018-11-23 08:42:21,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:21,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:21,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:42:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:42:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:42:21,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:42:21,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:42:21,892 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:42:21,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:42:21,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:42:21,906 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2018-11-23 08:42:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:42:21,936 INFO L93 Difference]: Finished difference Result 86 states and 153 transitions. [2018-11-23 08:42:21,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:42:21,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 153 transitions. [2018-11-23 08:42:21,941 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2018-11-23 08:42:21,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 76 states and 122 transitions. [2018-11-23 08:42:21,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2018-11-23 08:42:21,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-11-23 08:42:21,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 122 transitions. [2018-11-23 08:42:21,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:42:21,948 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 122 transitions. [2018-11-23 08:42:21,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 122 transitions. [2018-11-23 08:42:21,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 08:42:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 08:42:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 122 transitions. [2018-11-23 08:42:21,974 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 122 transitions. [2018-11-23 08:42:21,975 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 122 transitions. [2018-11-23 08:42:21,975 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 08:42:21,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 122 transitions. [2018-11-23 08:42:21,976 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2018-11-23 08:42:21,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:42:21,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:42:21,977 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 08:42:21,977 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:42:21,977 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; 161#L181-1 [2018-11-23 08:42:21,977 INFO L796 eck$LassoCheckResult]: Loop: 161#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 139#L47 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 140#L76 assume !(0 != main_~p1~0); 184#L76-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 214#L80-1 assume !(0 != main_~p3~0); 213#L84-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 212#L88-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 211#L92-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 210#L96-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 209#L100-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 208#L104-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 207#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 206#L112-1 assume !(0 != main_~p11~0); 205#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 204#L120-1 assume !(0 != main_~p1~0); 153#L126-1 assume !(0 != main_~p2~0); 155#L131-1 assume !(0 != main_~p3~0); 201#L136-1 assume !(0 != main_~p4~0); 199#L141-1 assume !(0 != main_~p5~0); 197#L146-1 assume !(0 != main_~p6~0); 168#L151-1 assume !(0 != main_~p7~0); 157#L156-1 assume !(0 != main_~p8~0); 183#L161-1 assume !(0 != main_~p9~0); 143#L166-1 assume !(0 != main_~p10~0); 144#L171-1 assume !(0 != main_~p11~0); 147#L176-1 assume !(0 != main_~p12~0); 161#L181-1 [2018-11-23 08:42:21,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:21,978 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-23 08:42:21,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:21,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:21,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:21,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:42:21,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:21,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:21,983 INFO L82 PathProgramCache]: Analyzing trace with hash -842101274, now seen corresponding path program 1 times [2018-11-23 08:42:21,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:21,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:21,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:21,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:42:21,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:42:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:42:22,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:42:22,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:42:22,028 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:42:22,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:42:22,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:42:22,029 INFO L87 Difference]: Start difference. First operand 76 states and 122 transitions. cyclomatic complexity: 48 Second operand 3 states. [2018-11-23 08:42:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:42:22,053 INFO L93 Difference]: Finished difference Result 149 states and 237 transitions. [2018-11-23 08:42:22,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:42:22,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 237 transitions. [2018-11-23 08:42:22,057 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2018-11-23 08:42:22,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 237 transitions. [2018-11-23 08:42:22,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2018-11-23 08:42:22,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2018-11-23 08:42:22,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 237 transitions. [2018-11-23 08:42:22,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:42:22,060 INFO L705 BuchiCegarLoop]: Abstraction has 149 states and 237 transitions. [2018-11-23 08:42:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 237 transitions. [2018-11-23 08:42:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-11-23 08:42:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-23 08:42:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 237 transitions. [2018-11-23 08:42:22,070 INFO L728 BuchiCegarLoop]: Abstraction has 149 states and 237 transitions. [2018-11-23 08:42:22,071 INFO L608 BuchiCegarLoop]: Abstraction has 149 states and 237 transitions. [2018-11-23 08:42:22,071 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 08:42:22,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 237 transitions. [2018-11-23 08:42:22,073 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2018-11-23 08:42:22,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:42:22,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:42:22,074 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 08:42:22,074 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:42:22,074 INFO L794 eck$LassoCheckResult]: Stem: 412#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; 413#L181-1 [2018-11-23 08:42:22,074 INFO L796 eck$LassoCheckResult]: Loop: 413#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 435#L47 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 433#L76 assume !(0 != main_~p1~0); 431#L76-2 assume !(0 != main_~p2~0); 430#L80-1 assume !(0 != main_~p3~0); 429#L84-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 428#L88-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 427#L92-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 426#L96-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 425#L100-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 424#L104-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 423#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 422#L112-1 assume !(0 != main_~p11~0); 420#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 418#L120-1 assume !(0 != main_~p1~0); 419#L126-1 assume !(0 != main_~p2~0); 455#L131-1 assume !(0 != main_~p3~0); 453#L136-1 assume !(0 != main_~p4~0); 451#L141-1 assume !(0 != main_~p5~0); 449#L146-1 assume !(0 != main_~p6~0); 447#L151-1 assume !(0 != main_~p7~0); 445#L156-1 assume !(0 != main_~p8~0); 443#L161-1 assume !(0 != main_~p9~0); 441#L166-1 assume !(0 != main_~p10~0); 439#L171-1 assume !(0 != main_~p11~0); 437#L176-1 assume !(0 != main_~p12~0); 413#L181-1 [2018-11-23 08:42:22,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2018-11-23 08:42:22,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:22,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:22,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:42:22,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:22,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:22,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1647427688, now seen corresponding path program 1 times [2018-11-23 08:42:22,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:22,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:22,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:42:22,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:42:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:42:22,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:42:22,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:42:22,119 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:42:22,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:42:22,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:42:22,119 INFO L87 Difference]: Start difference. First operand 149 states and 237 transitions. cyclomatic complexity: 92 Second operand 3 states. [2018-11-23 08:42:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:42:22,149 INFO L93 Difference]: Finished difference Result 293 states and 461 transitions. [2018-11-23 08:42:22,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:42:22,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 293 states and 461 transitions. [2018-11-23 08:42:22,153 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2018-11-23 08:42:22,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 293 states to 293 states and 461 transitions. [2018-11-23 08:42:22,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 293 [2018-11-23 08:42:22,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 293 [2018-11-23 08:42:22,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 293 states and 461 transitions. [2018-11-23 08:42:22,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:42:22,158 INFO L705 BuchiCegarLoop]: Abstraction has 293 states and 461 transitions. [2018-11-23 08:42:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states and 461 transitions. [2018-11-23 08:42:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-11-23 08:42:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-23 08:42:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 461 transitions. [2018-11-23 08:42:22,172 INFO L728 BuchiCegarLoop]: Abstraction has 293 states and 461 transitions. [2018-11-23 08:42:22,172 INFO L608 BuchiCegarLoop]: Abstraction has 293 states and 461 transitions. [2018-11-23 08:42:22,173 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 08:42:22,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 293 states and 461 transitions. [2018-11-23 08:42:22,175 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2018-11-23 08:42:22,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:42:22,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:42:22,176 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 08:42:22,176 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:42:22,176 INFO L794 eck$LassoCheckResult]: Stem: 863#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; 864#L181-1 [2018-11-23 08:42:22,176 INFO L796 eck$LassoCheckResult]: Loop: 864#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 906#L47 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 903#L76 assume !(0 != main_~p1~0); 900#L76-2 assume !(0 != main_~p2~0); 898#L80-1 assume !(0 != main_~p3~0); 895#L84-1 assume !(0 != main_~p4~0); 893#L88-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 891#L92-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 889#L96-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 887#L100-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 885#L104-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 883#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 881#L112-1 assume !(0 != main_~p11~0); 879#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 876#L120-1 assume !(0 != main_~p1~0); 877#L126-1 assume !(0 != main_~p2~0); 945#L131-1 assume !(0 != main_~p3~0); 940#L136-1 assume !(0 != main_~p4~0); 937#L141-1 assume !(0 != main_~p5~0); 933#L146-1 assume !(0 != main_~p6~0); 929#L151-1 assume !(0 != main_~p7~0); 925#L156-1 assume !(0 != main_~p8~0); 921#L161-1 assume !(0 != main_~p9~0); 917#L166-1 assume !(0 != main_~p10~0); 913#L171-1 assume !(0 != main_~p11~0); 910#L176-1 assume !(0 != main_~p12~0); 864#L181-1 [2018-11-23 08:42:22,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:22,177 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2018-11-23 08:42:22,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:22,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:22,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:42:22,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:22,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:22,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2070129514, now seen corresponding path program 1 times [2018-11-23 08:42:22,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:22,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:22,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:42:22,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:42:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:42:22,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:42:22,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:42:22,211 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:42:22,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:42:22,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:42:22,212 INFO L87 Difference]: Start difference. First operand 293 states and 461 transitions. cyclomatic complexity: 176 Second operand 3 states. [2018-11-23 08:42:22,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:42:22,228 INFO L93 Difference]: Finished difference Result 577 states and 897 transitions. [2018-11-23 08:42:22,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:42:22,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 577 states and 897 transitions. [2018-11-23 08:42:22,233 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2018-11-23 08:42:22,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 577 states to 577 states and 897 transitions. [2018-11-23 08:42:22,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 577 [2018-11-23 08:42:22,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 577 [2018-11-23 08:42:22,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 577 states and 897 transitions. [2018-11-23 08:42:22,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:42:22,241 INFO L705 BuchiCegarLoop]: Abstraction has 577 states and 897 transitions. [2018-11-23 08:42:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states and 897 transitions. [2018-11-23 08:42:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2018-11-23 08:42:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-11-23 08:42:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 897 transitions. [2018-11-23 08:42:22,262 INFO L728 BuchiCegarLoop]: Abstraction has 577 states and 897 transitions. [2018-11-23 08:42:22,263 INFO L608 BuchiCegarLoop]: Abstraction has 577 states and 897 transitions. [2018-11-23 08:42:22,263 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 08:42:22,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 577 states and 897 transitions. [2018-11-23 08:42:22,266 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2018-11-23 08:42:22,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:42:22,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:42:22,267 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 08:42:22,267 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:42:22,267 INFO L794 eck$LassoCheckResult]: Stem: 1741#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; 1742#L181-1 [2018-11-23 08:42:22,267 INFO L796 eck$LassoCheckResult]: Loop: 1742#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 1812#L47 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 1809#L76 assume !(0 != main_~p1~0); 1805#L76-2 assume !(0 != main_~p2~0); 1802#L80-1 assume !(0 != main_~p3~0); 1799#L84-1 assume !(0 != main_~p4~0); 1794#L88-1 assume !(0 != main_~p5~0); 1788#L92-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1789#L96-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1780#L100-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1781#L104-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1772#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1773#L112-1 assume !(0 != main_~p11~0); 1765#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1766#L120-1 assume !(0 != main_~p1~0); 1853#L126-1 assume !(0 != main_~p2~0); 1850#L131-1 assume !(0 != main_~p3~0); 1845#L136-1 assume !(0 != main_~p4~0); 1843#L141-1 assume !(0 != main_~p5~0); 1841#L146-1 assume !(0 != main_~p6~0); 1837#L151-1 assume !(0 != main_~p7~0); 1833#L156-1 assume !(0 != main_~p8~0); 1829#L161-1 assume !(0 != main_~p9~0); 1825#L166-1 assume !(0 != main_~p10~0); 1821#L171-1 assume !(0 != main_~p11~0); 1817#L176-1 assume !(0 != main_~p12~0); 1742#L181-1 [2018-11-23 08:42:22,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:22,268 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2018-11-23 08:42:22,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:22,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:22,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:42:22,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:22,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:22,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1252481064, now seen corresponding path program 1 times [2018-11-23 08:42:22,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:22,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:42:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:42:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:42:22,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:42:22,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:42:22,304 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:42:22,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:42:22,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:42:22,305 INFO L87 Difference]: Start difference. First operand 577 states and 897 transitions. cyclomatic complexity: 336 Second operand 3 states. [2018-11-23 08:42:22,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:42:22,322 INFO L93 Difference]: Finished difference Result 1137 states and 1745 transitions. [2018-11-23 08:42:22,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:42:22,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1137 states and 1745 transitions. [2018-11-23 08:42:22,330 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2018-11-23 08:42:22,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1137 states to 1137 states and 1745 transitions. [2018-11-23 08:42:22,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1137 [2018-11-23 08:42:22,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1137 [2018-11-23 08:42:22,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1137 states and 1745 transitions. [2018-11-23 08:42:22,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:42:22,337 INFO L705 BuchiCegarLoop]: Abstraction has 1137 states and 1745 transitions. [2018-11-23 08:42:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states and 1745 transitions. [2018-11-23 08:42:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1137. [2018-11-23 08:42:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1137 states. [2018-11-23 08:42:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1745 transitions. [2018-11-23 08:42:22,355 INFO L728 BuchiCegarLoop]: Abstraction has 1137 states and 1745 transitions. [2018-11-23 08:42:22,356 INFO L608 BuchiCegarLoop]: Abstraction has 1137 states and 1745 transitions. [2018-11-23 08:42:22,356 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 08:42:22,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1137 states and 1745 transitions. [2018-11-23 08:42:22,360 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2018-11-23 08:42:22,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:42:22,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:42:22,361 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 08:42:22,361 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:42:22,361 INFO L794 eck$LassoCheckResult]: Stem: 3455#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; 3456#L181-1 [2018-11-23 08:42:22,361 INFO L796 eck$LassoCheckResult]: Loop: 3456#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 3520#L47 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 3517#L76 assume !(0 != main_~p1~0); 3514#L76-2 assume !(0 != main_~p2~0); 3511#L80-1 assume !(0 != main_~p3~0); 3507#L84-1 assume !(0 != main_~p4~0); 3503#L88-1 assume !(0 != main_~p5~0); 3500#L92-1 assume !(0 != main_~p6~0); 3498#L96-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3496#L100-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3494#L104-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3492#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3490#L112-1 assume !(0 != main_~p11~0); 3488#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 3485#L120-1 assume !(0 != main_~p1~0); 3486#L126-1 assume !(0 != main_~p2~0); 3559#L131-1 assume !(0 != main_~p3~0); 3554#L136-1 assume !(0 != main_~p4~0); 3550#L141-1 assume !(0 != main_~p5~0); 3546#L146-1 assume !(0 != main_~p6~0); 3543#L151-1 assume !(0 != main_~p7~0); 3539#L156-1 assume !(0 != main_~p8~0); 3535#L161-1 assume !(0 != main_~p9~0); 3531#L166-1 assume !(0 != main_~p10~0); 3527#L171-1 assume !(0 != main_~p11~0); 3524#L176-1 assume !(0 != main_~p12~0); 3456#L181-1 [2018-11-23 08:42:22,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:22,362 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2018-11-23 08:42:22,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:22,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:22,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:42:22,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:22,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash -436462678, now seen corresponding path program 1 times [2018-11-23 08:42:22,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:22,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:22,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:42:22,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:42:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:42:22,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:42:22,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:42:22,395 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:42:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:42:22,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:42:22,395 INFO L87 Difference]: Start difference. First operand 1137 states and 1745 transitions. cyclomatic complexity: 640 Second operand 3 states. [2018-11-23 08:42:22,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:42:22,437 INFO L93 Difference]: Finished difference Result 2241 states and 3393 transitions. [2018-11-23 08:42:22,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:42:22,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2241 states and 3393 transitions. [2018-11-23 08:42:22,450 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2018-11-23 08:42:22,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2241 states to 2241 states and 3393 transitions. [2018-11-23 08:42:22,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2241 [2018-11-23 08:42:22,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2241 [2018-11-23 08:42:22,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2241 states and 3393 transitions. [2018-11-23 08:42:22,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:42:22,462 INFO L705 BuchiCegarLoop]: Abstraction has 2241 states and 3393 transitions. [2018-11-23 08:42:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states and 3393 transitions. [2018-11-23 08:42:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2241. [2018-11-23 08:42:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2241 states. [2018-11-23 08:42:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3393 transitions. [2018-11-23 08:42:22,492 INFO L728 BuchiCegarLoop]: Abstraction has 2241 states and 3393 transitions. [2018-11-23 08:42:22,492 INFO L608 BuchiCegarLoop]: Abstraction has 2241 states and 3393 transitions. [2018-11-23 08:42:22,492 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 08:42:22,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2241 states and 3393 transitions. [2018-11-23 08:42:22,501 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2018-11-23 08:42:22,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:42:22,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:42:22,502 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 08:42:22,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:42:22,503 INFO L794 eck$LassoCheckResult]: Stem: 6841#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; 6842#L181-1 [2018-11-23 08:42:22,503 INFO L796 eck$LassoCheckResult]: Loop: 6842#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 6923#L47 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 6920#L76 assume !(0 != main_~p1~0); 6916#L76-2 assume !(0 != main_~p2~0); 6913#L80-1 assume !(0 != main_~p3~0); 6910#L84-1 assume !(0 != main_~p4~0); 6906#L88-1 assume !(0 != main_~p5~0); 6902#L92-1 assume !(0 != main_~p6~0); 6897#L96-1 assume !(0 != main_~p7~0); 6891#L100-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 6892#L104-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 6883#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 6884#L112-1 assume !(0 != main_~p11~0); 6876#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 6877#L120-1 assume !(0 != main_~p1~0); 6964#L126-1 assume !(0 != main_~p2~0); 6961#L131-1 assume !(0 != main_~p3~0); 6956#L136-1 assume !(0 != main_~p4~0); 6952#L141-1 assume !(0 != main_~p5~0); 6948#L146-1 assume !(0 != main_~p6~0); 6946#L151-1 assume !(0 != main_~p7~0); 6944#L156-1 assume !(0 != main_~p8~0); 6940#L161-1 assume !(0 != main_~p9~0); 6936#L166-1 assume !(0 != main_~p10~0); 6932#L171-1 assume !(0 != main_~p11~0); 6928#L176-1 assume !(0 != main_~p12~0); 6842#L181-1 [2018-11-23 08:42:22,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:22,504 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2018-11-23 08:42:22,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:22,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:22,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:42:22,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:22,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:22,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1864359912, now seen corresponding path program 1 times [2018-11-23 08:42:22,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:22,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:22,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:42:22,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:42:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:42:22,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:42:22,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:42:22,534 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:42:22,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:42:22,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:42:22,534 INFO L87 Difference]: Start difference. First operand 2241 states and 3393 transitions. cyclomatic complexity: 1216 Second operand 3 states. [2018-11-23 08:42:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:42:22,561 INFO L93 Difference]: Finished difference Result 4417 states and 6593 transitions. [2018-11-23 08:42:22,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:42:22,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4417 states and 6593 transitions. [2018-11-23 08:42:22,584 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2018-11-23 08:42:22,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4417 states to 4417 states and 6593 transitions. [2018-11-23 08:42:22,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4417 [2018-11-23 08:42:22,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4417 [2018-11-23 08:42:22,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4417 states and 6593 transitions. [2018-11-23 08:42:22,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:42:22,608 INFO L705 BuchiCegarLoop]: Abstraction has 4417 states and 6593 transitions. [2018-11-23 08:42:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4417 states and 6593 transitions. [2018-11-23 08:42:22,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4417 to 4417. [2018-11-23 08:42:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4417 states. [2018-11-23 08:42:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4417 states to 4417 states and 6593 transitions. [2018-11-23 08:42:22,670 INFO L728 BuchiCegarLoop]: Abstraction has 4417 states and 6593 transitions. [2018-11-23 08:42:22,670 INFO L608 BuchiCegarLoop]: Abstraction has 4417 states and 6593 transitions. [2018-11-23 08:42:22,670 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 08:42:22,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4417 states and 6593 transitions. [2018-11-23 08:42:22,685 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2018-11-23 08:42:22,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:42:22,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:42:22,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 08:42:22,687 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:42:22,687 INFO L794 eck$LassoCheckResult]: Stem: 13513#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; 13514#L181-1 [2018-11-23 08:42:22,687 INFO L796 eck$LassoCheckResult]: Loop: 13514#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 13625#L47 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 13620#L76 assume !(0 != main_~p1~0); 13612#L76-2 assume !(0 != main_~p2~0); 13605#L80-1 assume !(0 != main_~p3~0); 13600#L84-1 assume !(0 != main_~p4~0); 13592#L88-1 assume !(0 != main_~p5~0); 13584#L92-1 assume !(0 != main_~p6~0); 13577#L96-1 assume !(0 != main_~p7~0); 13568#L100-1 assume !(0 != main_~p8~0); 13569#L104-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 13706#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 13700#L112-1 assume !(0 != main_~p11~0); 13686#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 13684#L120-1 assume !(0 != main_~p1~0); 13682#L126-1 assume !(0 != main_~p2~0); 13679#L131-1 assume !(0 != main_~p3~0); 13674#L136-1 assume !(0 != main_~p4~0); 13670#L141-1 assume !(0 != main_~p5~0); 13666#L146-1 assume !(0 != main_~p6~0); 13663#L151-1 assume !(0 != main_~p7~0); 13661#L156-1 assume !(0 != main_~p8~0); 13660#L161-1 assume !(0 != main_~p9~0); 13658#L166-1 assume !(0 != main_~p10~0); 13656#L171-1 assume !(0 != main_~p11~0); 13636#L176-1 assume !(0 != main_~p12~0); 13514#L181-1 [2018-11-23 08:42:22,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:22,687 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2018-11-23 08:42:22,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:22,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:22,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:42:22,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:22,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:22,692 INFO L82 PathProgramCache]: Analyzing trace with hash 276012010, now seen corresponding path program 1 times [2018-11-23 08:42:22,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:22,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:22,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:42:22,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:42:22,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:42:22,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:42:22,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:42:22,719 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:42:22,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:42:22,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:42:22,719 INFO L87 Difference]: Start difference. First operand 4417 states and 6593 transitions. cyclomatic complexity: 2304 Second operand 3 states. [2018-11-23 08:42:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:42:22,769 INFO L93 Difference]: Finished difference Result 8705 states and 12801 transitions. [2018-11-23 08:42:22,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:42:22,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8705 states and 12801 transitions. [2018-11-23 08:42:22,805 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2018-11-23 08:42:22,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8705 states to 8705 states and 12801 transitions. [2018-11-23 08:42:22,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8705 [2018-11-23 08:42:22,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8705 [2018-11-23 08:42:22,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8705 states and 12801 transitions. [2018-11-23 08:42:22,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:42:22,851 INFO L705 BuchiCegarLoop]: Abstraction has 8705 states and 12801 transitions. [2018-11-23 08:42:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8705 states and 12801 transitions. [2018-11-23 08:42:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8705 to 8705. [2018-11-23 08:42:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8705 states. [2018-11-23 08:42:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8705 states to 8705 states and 12801 transitions. [2018-11-23 08:42:22,967 INFO L728 BuchiCegarLoop]: Abstraction has 8705 states and 12801 transitions. [2018-11-23 08:42:22,967 INFO L608 BuchiCegarLoop]: Abstraction has 8705 states and 12801 transitions. [2018-11-23 08:42:22,968 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 08:42:22,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8705 states and 12801 transitions. [2018-11-23 08:42:22,994 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2018-11-23 08:42:22,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:42:22,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:42:22,995 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 08:42:22,995 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:42:22,995 INFO L794 eck$LassoCheckResult]: Stem: 26637#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; 26638#L181-1 [2018-11-23 08:42:22,995 INFO L796 eck$LassoCheckResult]: Loop: 26638#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 26741#L47 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 26737#L76 assume !(0 != main_~p1~0); 26735#L76-2 assume !(0 != main_~p2~0); 26733#L80-1 assume !(0 != main_~p3~0); 26729#L84-1 assume !(0 != main_~p4~0); 26725#L88-1 assume !(0 != main_~p5~0); 26721#L92-1 assume !(0 != main_~p6~0); 26717#L96-1 assume !(0 != main_~p7~0); 26713#L100-1 assume !(0 != main_~p8~0); 26709#L104-1 assume !(0 != main_~p9~0); 26707#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 26705#L112-1 assume !(0 != main_~p11~0); 26703#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 26699#L120-1 assume !(0 != main_~p1~0); 26697#L126-1 assume !(0 != main_~p2~0); 26691#L131-1 assume !(0 != main_~p3~0); 26690#L136-1 assume !(0 != main_~p4~0); 26772#L141-1 assume !(0 != main_~p5~0); 26768#L146-1 assume !(0 != main_~p6~0); 26764#L151-1 assume !(0 != main_~p7~0); 26760#L156-1 assume !(0 != main_~p8~0); 26756#L161-1 assume !(0 != main_~p9~0); 26753#L166-1 assume !(0 != main_~p10~0); 26749#L171-1 assume !(0 != main_~p11~0); 26745#L176-1 assume !(0 != main_~p12~0); 26638#L181-1 [2018-11-23 08:42:22,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:22,996 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2018-11-23 08:42:22,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:22,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:22,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:42:22,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:23,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:23,000 INFO L82 PathProgramCache]: Analyzing trace with hash -745056344, now seen corresponding path program 1 times [2018-11-23 08:42:23,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:23,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:23,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:23,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:42:23,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:42:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:42:23,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:42:23,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:42:23,027 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:42:23,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:42:23,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:42:23,027 INFO L87 Difference]: Start difference. First operand 8705 states and 12801 transitions. cyclomatic complexity: 4352 Second operand 3 states. [2018-11-23 08:42:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:42:23,081 INFO L93 Difference]: Finished difference Result 17153 states and 24833 transitions. [2018-11-23 08:42:23,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:42:23,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17153 states and 24833 transitions. [2018-11-23 08:42:23,205 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2018-11-23 08:42:23,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17153 states to 17153 states and 24833 transitions. [2018-11-23 08:42:23,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17153 [2018-11-23 08:42:23,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17153 [2018-11-23 08:42:23,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17153 states and 24833 transitions. [2018-11-23 08:42:23,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:42:23,286 INFO L705 BuchiCegarLoop]: Abstraction has 17153 states and 24833 transitions. [2018-11-23 08:42:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17153 states and 24833 transitions. [2018-11-23 08:42:23,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17153 to 17153. [2018-11-23 08:42:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17153 states. [2018-11-23 08:42:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17153 states to 17153 states and 24833 transitions. [2018-11-23 08:42:23,517 INFO L728 BuchiCegarLoop]: Abstraction has 17153 states and 24833 transitions. [2018-11-23 08:42:23,517 INFO L608 BuchiCegarLoop]: Abstraction has 17153 states and 24833 transitions. [2018-11-23 08:42:23,518 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 08:42:23,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17153 states and 24833 transitions. [2018-11-23 08:42:23,569 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2018-11-23 08:42:23,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:42:23,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:42:23,570 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 08:42:23,570 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:42:23,570 INFO L794 eck$LassoCheckResult]: Stem: 52502#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; 52503#L181-1 [2018-11-23 08:42:23,571 INFO L796 eck$LassoCheckResult]: Loop: 52503#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 52618#L47 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 52614#L76 assume !(0 != main_~p1~0); 52612#L76-2 assume !(0 != main_~p2~0); 52610#L80-1 assume !(0 != main_~p3~0); 52606#L84-1 assume !(0 != main_~p4~0); 52602#L88-1 assume !(0 != main_~p5~0); 52598#L92-1 assume !(0 != main_~p6~0); 52594#L96-1 assume !(0 != main_~p7~0); 52590#L100-1 assume !(0 != main_~p8~0); 52586#L104-1 assume !(0 != main_~p9~0); 52582#L108-1 assume !(0 != main_~p10~0); 52580#L112-1 assume !(0 != main_~p11~0); 52578#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 52574#L120-1 assume !(0 != main_~p1~0); 52572#L126-1 assume !(0 != main_~p2~0); 52566#L131-1 assume !(0 != main_~p3~0); 52565#L136-1 assume !(0 != main_~p4~0); 52649#L141-1 assume !(0 != main_~p5~0); 52645#L146-1 assume !(0 != main_~p6~0); 52641#L151-1 assume !(0 != main_~p7~0); 52637#L156-1 assume !(0 != main_~p8~0); 52633#L161-1 assume !(0 != main_~p9~0); 52629#L166-1 assume !(0 != main_~p10~0); 52626#L171-1 assume !(0 != main_~p11~0); 52622#L176-1 assume !(0 != main_~p12~0); 52503#L181-1 [2018-11-23 08:42:23,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:23,571 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2018-11-23 08:42:23,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:23,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:23,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:23,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:42:23,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:23,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:23,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2024920022, now seen corresponding path program 1 times [2018-11-23 08:42:23,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:23,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:23,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:23,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:42:23,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:42:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:42:23,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:42:23,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 08:42:23,594 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:42:23,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:42:23,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:42:23,595 INFO L87 Difference]: Start difference. First operand 17153 states and 24833 transitions. cyclomatic complexity: 8192 Second operand 3 states. [2018-11-23 08:42:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:42:23,682 INFO L93 Difference]: Finished difference Result 33793 states and 48129 transitions. [2018-11-23 08:42:23,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:42:23,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33793 states and 48129 transitions. [2018-11-23 08:42:23,776 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2018-11-23 08:42:23,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33793 states to 33793 states and 48129 transitions. [2018-11-23 08:42:23,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33793 [2018-11-23 08:42:23,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33793 [2018-11-23 08:42:23,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33793 states and 48129 transitions. [2018-11-23 08:42:23,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:42:23,885 INFO L705 BuchiCegarLoop]: Abstraction has 33793 states and 48129 transitions. [2018-11-23 08:42:23,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33793 states and 48129 transitions. [2018-11-23 08:42:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33793 to 33793. [2018-11-23 08:42:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33793 states. [2018-11-23 08:42:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33793 states to 33793 states and 48129 transitions. [2018-11-23 08:42:24,371 INFO L728 BuchiCegarLoop]: Abstraction has 33793 states and 48129 transitions. [2018-11-23 08:42:24,371 INFO L608 BuchiCegarLoop]: Abstraction has 33793 states and 48129 transitions. [2018-11-23 08:42:24,371 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 08:42:24,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33793 states and 48129 transitions. [2018-11-23 08:42:24,426 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2018-11-23 08:42:24,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:42:24,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:42:24,426 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 08:42:24,426 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:42:24,427 INFO L794 eck$LassoCheckResult]: Stem: 103453#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; 103454#L181-1 [2018-11-23 08:42:24,427 INFO L796 eck$LassoCheckResult]: Loop: 103454#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 103573#L47 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 103569#L76 assume !(0 != main_~p1~0); 103567#L76-2 assume !(0 != main_~p2~0); 103565#L80-1 assume !(0 != main_~p3~0); 103561#L84-1 assume !(0 != main_~p4~0); 103557#L88-1 assume !(0 != main_~p5~0); 103553#L92-1 assume !(0 != main_~p6~0); 103549#L96-1 assume !(0 != main_~p7~0); 103545#L100-1 assume !(0 != main_~p8~0); 103541#L104-1 assume !(0 != main_~p9~0); 103537#L108-1 assume !(0 != main_~p10~0); 103535#L112-1 assume !(0 != main_~p11~0); 103531#L116-1 assume !(0 != main_~p12~0); 103527#L120-1 assume !(0 != main_~p1~0); 103525#L126-1 assume !(0 != main_~p2~0); 103519#L131-1 assume !(0 != main_~p3~0); 103518#L136-1 assume !(0 != main_~p4~0); 103604#L141-1 assume !(0 != main_~p5~0); 103600#L146-1 assume !(0 != main_~p6~0); 103596#L151-1 assume !(0 != main_~p7~0); 103592#L156-1 assume !(0 != main_~p8~0); 103588#L161-1 assume !(0 != main_~p9~0); 103584#L166-1 assume !(0 != main_~p10~0); 103581#L171-1 assume !(0 != main_~p11~0); 103576#L176-1 assume !(0 != main_~p12~0); 103454#L181-1 [2018-11-23 08:42:24,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:24,427 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 11 times [2018-11-23 08:42:24,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:24,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:24,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:24,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:42:24,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:24,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:24,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1683241260, now seen corresponding path program 1 times [2018-11-23 08:42:24,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:24,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:24,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:24,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:42:24,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:24,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:42:24,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1428504715, now seen corresponding path program 1 times [2018-11-23 08:42:24,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:42:24,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:42:24,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:24,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:42:24,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:42:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:42:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L30] ~p9~0 := #t~nondet8; [L30] havoc #t~nondet8; [L31] havoc ~lk9~0; [L33] ~p10~0 := #t~nondet9; [L33] havoc #t~nondet9; [L34] havoc ~lk10~0; [L36] ~p11~0 := #t~nondet10; [L36] havoc #t~nondet10; [L37] havoc ~lk11~0; [L39] ~p12~0 := #t~nondet11; [L39] havoc #t~nondet11; [L40] havoc ~lk12~0; [L43] havoc ~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L30] ~p9~0 := #t~nondet8; [L30] havoc #t~nondet8; [L31] havoc ~lk9~0; [L33] ~p10~0 := #t~nondet9; [L33] havoc #t~nondet9; [L34] havoc ~lk10~0; [L36] ~p11~0 := #t~nondet10; [L36] havoc #t~nondet10; [L37] havoc ~lk11~0; [L39] ~p12~0 := #t~nondet11; [L39] havoc #t~nondet11; [L40] havoc ~lk12~0; [L43] havoc ~cond~0; [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L43] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; [?] assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [?] assume !(0 != main_~p8~0); [?] assume !(0 != main_~p9~0); [?] assume !(0 != main_~p10~0); [?] assume !(0 != main_~p11~0); [?] assume !(0 != main_~p12~0); [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [?] assume !(0 != main_~p8~0); [?] assume !(0 != main_~p9~0); [?] assume !(0 != main_~p10~0); [?] assume !(0 != main_~p11~0); [?] assume !(0 != main_~p12~0); [L45-L186] assume !false; [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47-L49] assume !(0 == main_~cond~0); [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76-L78] assume !(0 != main_~p1~0); [L80-L82] assume !(0 != main_~p2~0); [L84-L86] assume !(0 != main_~p3~0); [L88-L90] assume !(0 != main_~p4~0); [L92-L94] assume !(0 != main_~p5~0); [L96-L98] assume !(0 != main_~p6~0); [L100-L102] assume !(0 != main_~p7~0); [L104-L106] assume !(0 != main_~p8~0); [L108-L110] assume !(0 != main_~p9~0); [L112-L114] assume !(0 != main_~p10~0); [L116-L118] assume !(0 != main_~p11~0); [L120-L122] assume !(0 != main_~p12~0); [L126-L129] assume !(0 != main_~p1~0); [L131-L134] assume !(0 != main_~p2~0); [L136-L139] assume !(0 != main_~p3~0); [L141-L144] assume !(0 != main_~p4~0); [L146-L149] assume !(0 != main_~p5~0); [L151-L154] assume !(0 != main_~p6~0); [L156-L159] assume !(0 != main_~p7~0); [L161-L164] assume !(0 != main_~p8~0); [L166-L169] assume !(0 != main_~p9~0); [L171-L174] assume !(0 != main_~p10~0); [L176-L179] assume !(0 != main_~p11~0); [L181-L184] assume !(0 != main_~p12~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L45-L186] assume !false; [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47-L49] assume !(0 == main_~cond~0); [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76-L78] assume !(0 != main_~p1~0); [L80-L82] assume !(0 != main_~p2~0); [L84-L86] assume !(0 != main_~p3~0); [L88-L90] assume !(0 != main_~p4~0); [L92-L94] assume !(0 != main_~p5~0); [L96-L98] assume !(0 != main_~p6~0); [L100-L102] assume !(0 != main_~p7~0); [L104-L106] assume !(0 != main_~p8~0); [L108-L110] assume !(0 != main_~p9~0); [L112-L114] assume !(0 != main_~p10~0); [L116-L118] assume !(0 != main_~p11~0); [L120-L122] assume !(0 != main_~p12~0); [L126-L129] assume !(0 != main_~p1~0); [L131-L134] assume !(0 != main_~p2~0); [L136-L139] assume !(0 != main_~p3~0); [L141-L144] assume !(0 != main_~p4~0); [L146-L149] assume !(0 != main_~p5~0); [L151-L154] assume !(0 != main_~p6~0); [L156-L159] assume !(0 != main_~p7~0); [L161-L164] assume !(0 != main_~p8~0); [L166-L169] assume !(0 != main_~p9~0); [L171-L174] assume !(0 != main_~p10~0); [L176-L179] assume !(0 != main_~p11~0); [L181-L184] assume !(0 != main_~p12~0); [L45-L186] COND FALSE !(false) [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47] COND FALSE !(0 == main_~cond~0) [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76] COND FALSE !(0 != main_~p1~0) [L80] COND FALSE !(0 != main_~p2~0) [L84] COND FALSE !(0 != main_~p3~0) [L88] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L96] COND FALSE !(0 != main_~p6~0) [L100] COND FALSE !(0 != main_~p7~0) [L104] COND FALSE !(0 != main_~p8~0) [L108] COND FALSE !(0 != main_~p9~0) [L112] COND FALSE !(0 != main_~p10~0) [L116] COND FALSE !(0 != main_~p11~0) [L120] COND FALSE !(0 != main_~p12~0) [L126] COND FALSE !(0 != main_~p1~0) [L131] COND FALSE !(0 != main_~p2~0) [L136] COND FALSE !(0 != main_~p3~0) [L141] COND FALSE !(0 != main_~p4~0) [L146] COND FALSE !(0 != main_~p5~0) [L151] COND FALSE !(0 != main_~p6~0) [L156] COND FALSE !(0 != main_~p7~0) [L161] COND FALSE !(0 != main_~p8~0) [L166] COND FALSE !(0 != main_~p9~0) [L171] COND FALSE !(0 != main_~p10~0) [L176] COND FALSE !(0 != main_~p11~0) [L181] COND FALSE !(0 != main_~p12~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L45-L186] COND FALSE !(false) [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47] COND FALSE !(0 == main_~cond~0) [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76] COND FALSE !(0 != main_~p1~0) [L80] COND FALSE !(0 != main_~p2~0) [L84] COND FALSE !(0 != main_~p3~0) [L88] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L96] COND FALSE !(0 != main_~p6~0) [L100] COND FALSE !(0 != main_~p7~0) [L104] COND FALSE !(0 != main_~p8~0) [L108] COND FALSE !(0 != main_~p9~0) [L112] COND FALSE !(0 != main_~p10~0) [L116] COND FALSE !(0 != main_~p11~0) [L120] COND FALSE !(0 != main_~p12~0) [L126] COND FALSE !(0 != main_~p1~0) [L131] COND FALSE !(0 != main_~p2~0) [L136] COND FALSE !(0 != main_~p3~0) [L141] COND FALSE !(0 != main_~p4~0) [L146] COND FALSE !(0 != main_~p5~0) [L151] COND FALSE !(0 != main_~p6~0) [L156] COND FALSE !(0 != main_~p7~0) [L161] COND FALSE !(0 != main_~p8~0) [L166] COND FALSE !(0 != main_~p9~0) [L171] COND FALSE !(0 != main_~p10~0) [L176] COND FALSE !(0 != main_~p11~0) [L181] COND FALSE !(0 != main_~p12~0) [L45-L186] COND FALSE !(false) [L46] ~cond~0 := #t~nondet12; [L46] havoc #t~nondet12; [L47] COND FALSE !(0 == ~cond~0) [L50] ~lk1~0 := 0; [L52] ~lk2~0 := 0; [L54] ~lk3~0 := 0; [L56] ~lk4~0 := 0; [L58] ~lk5~0 := 0; [L60] ~lk6~0 := 0; [L62] ~lk7~0 := 0; [L64] ~lk8~0 := 0; [L66] ~lk9~0 := 0; [L68] ~lk10~0 := 0; [L70] ~lk11~0 := 0; [L72] ~lk12~0 := 0; [L76] COND FALSE !(0 != ~p1~0) [L80] COND FALSE !(0 != ~p2~0) [L84] COND FALSE !(0 != ~p3~0) [L88] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L96] COND FALSE !(0 != ~p6~0) [L100] COND FALSE !(0 != ~p7~0) [L104] COND FALSE !(0 != ~p8~0) [L108] COND FALSE !(0 != ~p9~0) [L112] COND FALSE !(0 != ~p10~0) [L116] COND FALSE !(0 != ~p11~0) [L120] COND FALSE !(0 != ~p12~0) [L126] COND FALSE !(0 != ~p1~0) [L131] COND FALSE !(0 != ~p2~0) [L136] COND FALSE !(0 != ~p3~0) [L141] COND FALSE !(0 != ~p4~0) [L146] COND FALSE !(0 != ~p5~0) [L151] COND FALSE !(0 != ~p6~0) [L156] COND FALSE !(0 != ~p7~0) [L161] COND FALSE !(0 != ~p8~0) [L166] COND FALSE !(0 != ~p9~0) [L171] COND FALSE !(0 != ~p10~0) [L176] COND FALSE !(0 != ~p11~0) [L181] COND FALSE !(0 != ~p12~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L45-L186] COND FALSE !(false) [L46] ~cond~0 := #t~nondet12; [L46] havoc #t~nondet12; [L47] COND FALSE !(0 == ~cond~0) [L50] ~lk1~0 := 0; [L52] ~lk2~0 := 0; [L54] ~lk3~0 := 0; [L56] ~lk4~0 := 0; [L58] ~lk5~0 := 0; [L60] ~lk6~0 := 0; [L62] ~lk7~0 := 0; [L64] ~lk8~0 := 0; [L66] ~lk9~0 := 0; [L68] ~lk10~0 := 0; [L70] ~lk11~0 := 0; [L72] ~lk12~0 := 0; [L76] COND FALSE !(0 != ~p1~0) [L80] COND FALSE !(0 != ~p2~0) [L84] COND FALSE !(0 != ~p3~0) [L88] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L96] COND FALSE !(0 != ~p6~0) [L100] COND FALSE !(0 != ~p7~0) [L104] COND FALSE !(0 != ~p8~0) [L108] COND FALSE !(0 != ~p9~0) [L112] COND FALSE !(0 != ~p10~0) [L116] COND FALSE !(0 != ~p11~0) [L120] COND FALSE !(0 != ~p12~0) [L126] COND FALSE !(0 != ~p1~0) [L131] COND FALSE !(0 != ~p2~0) [L136] COND FALSE !(0 != ~p3~0) [L141] COND FALSE !(0 != ~p4~0) [L146] COND FALSE !(0 != ~p5~0) [L151] COND FALSE !(0 != ~p6~0) [L156] COND FALSE !(0 != ~p7~0) [L161] COND FALSE !(0 != ~p8~0) [L166] COND FALSE !(0 != ~p9~0) [L171] COND FALSE !(0 != ~p10~0) [L176] COND FALSE !(0 != ~p11~0) [L181] COND FALSE !(0 != ~p12~0) [L45] COND TRUE 1 [L46] cond = __VERIFIER_nondet_int() [L47] COND FALSE !(cond == 0) [L50] lk1 = 0 [L52] lk2 = 0 [L54] lk3 = 0 [L56] lk4 = 0 [L58] lk5 = 0 [L60] lk6 = 0 [L62] lk7 = 0 [L64] lk8 = 0 [L66] lk9 = 0 [L68] lk10 = 0 [L70] lk11 = 0 [L72] lk12 = 0 [L76] COND FALSE !(p1 != 0) [L80] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L88] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L96] COND FALSE !(p6 != 0) [L100] COND FALSE !(p7 != 0) [L104] COND FALSE !(p8 != 0) [L108] COND FALSE !(p9 != 0) [L112] COND FALSE !(p10 != 0) [L116] COND FALSE !(p11 != 0) [L120] COND FALSE !(p12 != 0) [L126] COND FALSE !(p1 != 0) [L131] COND FALSE !(p2 != 0) [L136] COND FALSE !(p3 != 0) [L141] COND FALSE !(p4 != 0) [L146] COND FALSE !(p5 != 0) [L151] COND FALSE !(p6 != 0) [L156] COND FALSE !(p7 != 0) [L161] COND FALSE !(p8 != 0) [L166] COND FALSE !(p9 != 0) [L171] COND FALSE !(p10 != 0) [L176] COND FALSE !(p11 != 0) [L181] COND FALSE !(p12 != 0) ----- [2018-11-23 08:42:24,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 08:42:24 BoogieIcfgContainer [2018-11-23 08:42:24,641 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 08:42:24,641 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:42:24,641 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:42:24,641 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:42:24,642 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:42:21" (3/4) ... [2018-11-23 08:42:24,644 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L30] ~p9~0 := #t~nondet8; [L30] havoc #t~nondet8; [L31] havoc ~lk9~0; [L33] ~p10~0 := #t~nondet9; [L33] havoc #t~nondet9; [L34] havoc ~lk10~0; [L36] ~p11~0 := #t~nondet10; [L36] havoc #t~nondet10; [L37] havoc ~lk11~0; [L39] ~p12~0 := #t~nondet11; [L39] havoc #t~nondet11; [L40] havoc ~lk12~0; [L43] havoc ~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L30] ~p9~0 := #t~nondet8; [L30] havoc #t~nondet8; [L31] havoc ~lk9~0; [L33] ~p10~0 := #t~nondet9; [L33] havoc #t~nondet9; [L34] havoc ~lk10~0; [L36] ~p11~0 := #t~nondet10; [L36] havoc #t~nondet10; [L37] havoc ~lk11~0; [L39] ~p12~0 := #t~nondet11; [L39] havoc #t~nondet11; [L40] havoc ~lk12~0; [L43] havoc ~cond~0; [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L43] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; [?] assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [?] assume !(0 != main_~p8~0); [?] assume !(0 != main_~p9~0); [?] assume !(0 != main_~p10~0); [?] assume !(0 != main_~p11~0); [?] assume !(0 != main_~p12~0); [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [?] assume !(0 != main_~p8~0); [?] assume !(0 != main_~p9~0); [?] assume !(0 != main_~p10~0); [?] assume !(0 != main_~p11~0); [?] assume !(0 != main_~p12~0); [L45-L186] assume !false; [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47-L49] assume !(0 == main_~cond~0); [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76-L78] assume !(0 != main_~p1~0); [L80-L82] assume !(0 != main_~p2~0); [L84-L86] assume !(0 != main_~p3~0); [L88-L90] assume !(0 != main_~p4~0); [L92-L94] assume !(0 != main_~p5~0); [L96-L98] assume !(0 != main_~p6~0); [L100-L102] assume !(0 != main_~p7~0); [L104-L106] assume !(0 != main_~p8~0); [L108-L110] assume !(0 != main_~p9~0); [L112-L114] assume !(0 != main_~p10~0); [L116-L118] assume !(0 != main_~p11~0); [L120-L122] assume !(0 != main_~p12~0); [L126-L129] assume !(0 != main_~p1~0); [L131-L134] assume !(0 != main_~p2~0); [L136-L139] assume !(0 != main_~p3~0); [L141-L144] assume !(0 != main_~p4~0); [L146-L149] assume !(0 != main_~p5~0); [L151-L154] assume !(0 != main_~p6~0); [L156-L159] assume !(0 != main_~p7~0); [L161-L164] assume !(0 != main_~p8~0); [L166-L169] assume !(0 != main_~p9~0); [L171-L174] assume !(0 != main_~p10~0); [L176-L179] assume !(0 != main_~p11~0); [L181-L184] assume !(0 != main_~p12~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L45-L186] assume !false; [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47-L49] assume !(0 == main_~cond~0); [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76-L78] assume !(0 != main_~p1~0); [L80-L82] assume !(0 != main_~p2~0); [L84-L86] assume !(0 != main_~p3~0); [L88-L90] assume !(0 != main_~p4~0); [L92-L94] assume !(0 != main_~p5~0); [L96-L98] assume !(0 != main_~p6~0); [L100-L102] assume !(0 != main_~p7~0); [L104-L106] assume !(0 != main_~p8~0); [L108-L110] assume !(0 != main_~p9~0); [L112-L114] assume !(0 != main_~p10~0); [L116-L118] assume !(0 != main_~p11~0); [L120-L122] assume !(0 != main_~p12~0); [L126-L129] assume !(0 != main_~p1~0); [L131-L134] assume !(0 != main_~p2~0); [L136-L139] assume !(0 != main_~p3~0); [L141-L144] assume !(0 != main_~p4~0); [L146-L149] assume !(0 != main_~p5~0); [L151-L154] assume !(0 != main_~p6~0); [L156-L159] assume !(0 != main_~p7~0); [L161-L164] assume !(0 != main_~p8~0); [L166-L169] assume !(0 != main_~p9~0); [L171-L174] assume !(0 != main_~p10~0); [L176-L179] assume !(0 != main_~p11~0); [L181-L184] assume !(0 != main_~p12~0); [L45-L186] COND FALSE !(false) [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47] COND FALSE !(0 == main_~cond~0) [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76] COND FALSE !(0 != main_~p1~0) [L80] COND FALSE !(0 != main_~p2~0) [L84] COND FALSE !(0 != main_~p3~0) [L88] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L96] COND FALSE !(0 != main_~p6~0) [L100] COND FALSE !(0 != main_~p7~0) [L104] COND FALSE !(0 != main_~p8~0) [L108] COND FALSE !(0 != main_~p9~0) [L112] COND FALSE !(0 != main_~p10~0) [L116] COND FALSE !(0 != main_~p11~0) [L120] COND FALSE !(0 != main_~p12~0) [L126] COND FALSE !(0 != main_~p1~0) [L131] COND FALSE !(0 != main_~p2~0) [L136] COND FALSE !(0 != main_~p3~0) [L141] COND FALSE !(0 != main_~p4~0) [L146] COND FALSE !(0 != main_~p5~0) [L151] COND FALSE !(0 != main_~p6~0) [L156] COND FALSE !(0 != main_~p7~0) [L161] COND FALSE !(0 != main_~p8~0) [L166] COND FALSE !(0 != main_~p9~0) [L171] COND FALSE !(0 != main_~p10~0) [L176] COND FALSE !(0 != main_~p11~0) [L181] COND FALSE !(0 != main_~p12~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L45-L186] COND FALSE !(false) [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47] COND FALSE !(0 == main_~cond~0) [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76] COND FALSE !(0 != main_~p1~0) [L80] COND FALSE !(0 != main_~p2~0) [L84] COND FALSE !(0 != main_~p3~0) [L88] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L96] COND FALSE !(0 != main_~p6~0) [L100] COND FALSE !(0 != main_~p7~0) [L104] COND FALSE !(0 != main_~p8~0) [L108] COND FALSE !(0 != main_~p9~0) [L112] COND FALSE !(0 != main_~p10~0) [L116] COND FALSE !(0 != main_~p11~0) [L120] COND FALSE !(0 != main_~p12~0) [L126] COND FALSE !(0 != main_~p1~0) [L131] COND FALSE !(0 != main_~p2~0) [L136] COND FALSE !(0 != main_~p3~0) [L141] COND FALSE !(0 != main_~p4~0) [L146] COND FALSE !(0 != main_~p5~0) [L151] COND FALSE !(0 != main_~p6~0) [L156] COND FALSE !(0 != main_~p7~0) [L161] COND FALSE !(0 != main_~p8~0) [L166] COND FALSE !(0 != main_~p9~0) [L171] COND FALSE !(0 != main_~p10~0) [L176] COND FALSE !(0 != main_~p11~0) [L181] COND FALSE !(0 != main_~p12~0) [L45-L186] COND FALSE !(false) [L46] ~cond~0 := #t~nondet12; [L46] havoc #t~nondet12; [L47] COND FALSE !(0 == ~cond~0) [L50] ~lk1~0 := 0; [L52] ~lk2~0 := 0; [L54] ~lk3~0 := 0; [L56] ~lk4~0 := 0; [L58] ~lk5~0 := 0; [L60] ~lk6~0 := 0; [L62] ~lk7~0 := 0; [L64] ~lk8~0 := 0; [L66] ~lk9~0 := 0; [L68] ~lk10~0 := 0; [L70] ~lk11~0 := 0; [L72] ~lk12~0 := 0; [L76] COND FALSE !(0 != ~p1~0) [L80] COND FALSE !(0 != ~p2~0) [L84] COND FALSE !(0 != ~p3~0) [L88] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L96] COND FALSE !(0 != ~p6~0) [L100] COND FALSE !(0 != ~p7~0) [L104] COND FALSE !(0 != ~p8~0) [L108] COND FALSE !(0 != ~p9~0) [L112] COND FALSE !(0 != ~p10~0) [L116] COND FALSE !(0 != ~p11~0) [L120] COND FALSE !(0 != ~p12~0) [L126] COND FALSE !(0 != ~p1~0) [L131] COND FALSE !(0 != ~p2~0) [L136] COND FALSE !(0 != ~p3~0) [L141] COND FALSE !(0 != ~p4~0) [L146] COND FALSE !(0 != ~p5~0) [L151] COND FALSE !(0 != ~p6~0) [L156] COND FALSE !(0 != ~p7~0) [L161] COND FALSE !(0 != ~p8~0) [L166] COND FALSE !(0 != ~p9~0) [L171] COND FALSE !(0 != ~p10~0) [L176] COND FALSE !(0 != ~p11~0) [L181] COND FALSE !(0 != ~p12~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L45-L186] COND FALSE !(false) [L46] ~cond~0 := #t~nondet12; [L46] havoc #t~nondet12; [L47] COND FALSE !(0 == ~cond~0) [L50] ~lk1~0 := 0; [L52] ~lk2~0 := 0; [L54] ~lk3~0 := 0; [L56] ~lk4~0 := 0; [L58] ~lk5~0 := 0; [L60] ~lk6~0 := 0; [L62] ~lk7~0 := 0; [L64] ~lk8~0 := 0; [L66] ~lk9~0 := 0; [L68] ~lk10~0 := 0; [L70] ~lk11~0 := 0; [L72] ~lk12~0 := 0; [L76] COND FALSE !(0 != ~p1~0) [L80] COND FALSE !(0 != ~p2~0) [L84] COND FALSE !(0 != ~p3~0) [L88] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L96] COND FALSE !(0 != ~p6~0) [L100] COND FALSE !(0 != ~p7~0) [L104] COND FALSE !(0 != ~p8~0) [L108] COND FALSE !(0 != ~p9~0) [L112] COND FALSE !(0 != ~p10~0) [L116] COND FALSE !(0 != ~p11~0) [L120] COND FALSE !(0 != ~p12~0) [L126] COND FALSE !(0 != ~p1~0) [L131] COND FALSE !(0 != ~p2~0) [L136] COND FALSE !(0 != ~p3~0) [L141] COND FALSE !(0 != ~p4~0) [L146] COND FALSE !(0 != ~p5~0) [L151] COND FALSE !(0 != ~p6~0) [L156] COND FALSE !(0 != ~p7~0) [L161] COND FALSE !(0 != ~p8~0) [L166] COND FALSE !(0 != ~p9~0) [L171] COND FALSE !(0 != ~p10~0) [L176] COND FALSE !(0 != ~p11~0) [L181] COND FALSE !(0 != ~p12~0) [L45] COND TRUE 1 [L46] cond = __VERIFIER_nondet_int() [L47] COND FALSE !(cond == 0) [L50] lk1 = 0 [L52] lk2 = 0 [L54] lk3 = 0 [L56] lk4 = 0 [L58] lk5 = 0 [L60] lk6 = 0 [L62] lk7 = 0 [L64] lk8 = 0 [L66] lk9 = 0 [L68] lk10 = 0 [L70] lk11 = 0 [L72] lk12 = 0 [L76] COND FALSE !(p1 != 0) [L80] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L88] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L96] COND FALSE !(p6 != 0) [L100] COND FALSE !(p7 != 0) [L104] COND FALSE !(p8 != 0) [L108] COND FALSE !(p9 != 0) [L112] COND FALSE !(p10 != 0) [L116] COND FALSE !(p11 != 0) [L120] COND FALSE !(p12 != 0) [L126] COND FALSE !(p1 != 0) [L131] COND FALSE !(p2 != 0) [L136] COND FALSE !(p3 != 0) [L141] COND FALSE !(p4 != 0) [L146] COND FALSE !(p5 != 0) [L151] COND FALSE !(p6 != 0) [L156] COND FALSE !(p7 != 0) [L161] COND FALSE !(p8 != 0) [L166] COND FALSE !(p9 != 0) [L171] COND FALSE !(p10 != 0) [L176] COND FALSE !(p11 != 0) [L181] COND FALSE !(p12 != 0) ----- [2018-11-23 08:42:24,705 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a0c13736-15c7-47f0-9f1c-764d743fb21c/bin-2019/uautomizer/witness.graphml [2018-11-23 08:42:24,706 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:42:24,706 INFO L168 Benchmark]: Toolchain (without parser) took 3750.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -110.8 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:42:24,708 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:42:24,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.68 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:42:24,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.05 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:42:24,708 INFO L168 Benchmark]: Boogie Preprocessor took 24.17 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 941.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:42:24,709 INFO L168 Benchmark]: RCFGBuilder took 384.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -160.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:42:24,709 INFO L168 Benchmark]: BuchiAutomizer took 3009.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 207.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:42:24,709 INFO L168 Benchmark]: Witness Printer took 64.75 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:42:24,712 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 232.68 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.05 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.17 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 941.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 384.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -160.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3009.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 207.7 MB. Max. memory is 11.5 GB. * Witness Printer took 64.75 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 33793 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had 33793 states and ocurred in iteration 10. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 947 SDtfs, 496 SDslu, 585 SDs, 0 SdLazy, 50 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 45]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f9f4d43=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@659756=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62877503=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4656e1a2=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c06687e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a5644b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f55aaab=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4695d429=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4eb5eec6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7906639d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@408f316=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@640f42b=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ae6248a=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 45]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L30] ~p9~0 := #t~nondet8; [L30] havoc #t~nondet8; [L31] havoc ~lk9~0; [L33] ~p10~0 := #t~nondet9; [L33] havoc #t~nondet9; [L34] havoc ~lk10~0; [L36] ~p11~0 := #t~nondet10; [L36] havoc #t~nondet10; [L37] havoc ~lk11~0; [L39] ~p12~0 := #t~nondet11; [L39] havoc #t~nondet11; [L40] havoc ~lk12~0; [L43] havoc ~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L30] ~p9~0 := #t~nondet8; [L30] havoc #t~nondet8; [L31] havoc ~lk9~0; [L33] ~p10~0 := #t~nondet9; [L33] havoc #t~nondet9; [L34] havoc ~lk10~0; [L36] ~p11~0 := #t~nondet10; [L36] havoc #t~nondet10; [L37] havoc ~lk11~0; [L39] ~p12~0 := #t~nondet11; [L39] havoc #t~nondet11; [L40] havoc ~lk12~0; [L43] havoc ~cond~0; [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L43] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; [?] assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [?] assume !(0 != main_~p8~0); [?] assume !(0 != main_~p9~0); [?] assume !(0 != main_~p10~0); [?] assume !(0 != main_~p11~0); [?] assume !(0 != main_~p12~0); [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [?] assume !(0 != main_~p8~0); [?] assume !(0 != main_~p9~0); [?] assume !(0 != main_~p10~0); [?] assume !(0 != main_~p11~0); [?] assume !(0 != main_~p12~0); [L45-L186] assume !false; [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47-L49] assume !(0 == main_~cond~0); [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76-L78] assume !(0 != main_~p1~0); [L80-L82] assume !(0 != main_~p2~0); [L84-L86] assume !(0 != main_~p3~0); [L88-L90] assume !(0 != main_~p4~0); [L92-L94] assume !(0 != main_~p5~0); [L96-L98] assume !(0 != main_~p6~0); [L100-L102] assume !(0 != main_~p7~0); [L104-L106] assume !(0 != main_~p8~0); [L108-L110] assume !(0 != main_~p9~0); [L112-L114] assume !(0 != main_~p10~0); [L116-L118] assume !(0 != main_~p11~0); [L120-L122] assume !(0 != main_~p12~0); [L126-L129] assume !(0 != main_~p1~0); [L131-L134] assume !(0 != main_~p2~0); [L136-L139] assume !(0 != main_~p3~0); [L141-L144] assume !(0 != main_~p4~0); [L146-L149] assume !(0 != main_~p5~0); [L151-L154] assume !(0 != main_~p6~0); [L156-L159] assume !(0 != main_~p7~0); [L161-L164] assume !(0 != main_~p8~0); [L166-L169] assume !(0 != main_~p9~0); [L171-L174] assume !(0 != main_~p10~0); [L176-L179] assume !(0 != main_~p11~0); [L181-L184] assume !(0 != main_~p12~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L45-L186] assume !false; [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47-L49] assume !(0 == main_~cond~0); [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76-L78] assume !(0 != main_~p1~0); [L80-L82] assume !(0 != main_~p2~0); [L84-L86] assume !(0 != main_~p3~0); [L88-L90] assume !(0 != main_~p4~0); [L92-L94] assume !(0 != main_~p5~0); [L96-L98] assume !(0 != main_~p6~0); [L100-L102] assume !(0 != main_~p7~0); [L104-L106] assume !(0 != main_~p8~0); [L108-L110] assume !(0 != main_~p9~0); [L112-L114] assume !(0 != main_~p10~0); [L116-L118] assume !(0 != main_~p11~0); [L120-L122] assume !(0 != main_~p12~0); [L126-L129] assume !(0 != main_~p1~0); [L131-L134] assume !(0 != main_~p2~0); [L136-L139] assume !(0 != main_~p3~0); [L141-L144] assume !(0 != main_~p4~0); [L146-L149] assume !(0 != main_~p5~0); [L151-L154] assume !(0 != main_~p6~0); [L156-L159] assume !(0 != main_~p7~0); [L161-L164] assume !(0 != main_~p8~0); [L166-L169] assume !(0 != main_~p9~0); [L171-L174] assume !(0 != main_~p10~0); [L176-L179] assume !(0 != main_~p11~0); [L181-L184] assume !(0 != main_~p12~0); [L45-L186] COND FALSE !(false) [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47] COND FALSE !(0 == main_~cond~0) [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76] COND FALSE !(0 != main_~p1~0) [L80] COND FALSE !(0 != main_~p2~0) [L84] COND FALSE !(0 != main_~p3~0) [L88] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L96] COND FALSE !(0 != main_~p6~0) [L100] COND FALSE !(0 != main_~p7~0) [L104] COND FALSE !(0 != main_~p8~0) [L108] COND FALSE !(0 != main_~p9~0) [L112] COND FALSE !(0 != main_~p10~0) [L116] COND FALSE !(0 != main_~p11~0) [L120] COND FALSE !(0 != main_~p12~0) [L126] COND FALSE !(0 != main_~p1~0) [L131] COND FALSE !(0 != main_~p2~0) [L136] COND FALSE !(0 != main_~p3~0) [L141] COND FALSE !(0 != main_~p4~0) [L146] COND FALSE !(0 != main_~p5~0) [L151] COND FALSE !(0 != main_~p6~0) [L156] COND FALSE !(0 != main_~p7~0) [L161] COND FALSE !(0 != main_~p8~0) [L166] COND FALSE !(0 != main_~p9~0) [L171] COND FALSE !(0 != main_~p10~0) [L176] COND FALSE !(0 != main_~p11~0) [L181] COND FALSE !(0 != main_~p12~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L45-L186] COND FALSE !(false) [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47] COND FALSE !(0 == main_~cond~0) [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76] COND FALSE !(0 != main_~p1~0) [L80] COND FALSE !(0 != main_~p2~0) [L84] COND FALSE !(0 != main_~p3~0) [L88] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L96] COND FALSE !(0 != main_~p6~0) [L100] COND FALSE !(0 != main_~p7~0) [L104] COND FALSE !(0 != main_~p8~0) [L108] COND FALSE !(0 != main_~p9~0) [L112] COND FALSE !(0 != main_~p10~0) [L116] COND FALSE !(0 != main_~p11~0) [L120] COND FALSE !(0 != main_~p12~0) [L126] COND FALSE !(0 != main_~p1~0) [L131] COND FALSE !(0 != main_~p2~0) [L136] COND FALSE !(0 != main_~p3~0) [L141] COND FALSE !(0 != main_~p4~0) [L146] COND FALSE !(0 != main_~p5~0) [L151] COND FALSE !(0 != main_~p6~0) [L156] COND FALSE !(0 != main_~p7~0) [L161] COND FALSE !(0 != main_~p8~0) [L166] COND FALSE !(0 != main_~p9~0) [L171] COND FALSE !(0 != main_~p10~0) [L176] COND FALSE !(0 != main_~p11~0) [L181] COND FALSE !(0 != main_~p12~0) [L45-L186] COND FALSE !(false) [L46] ~cond~0 := #t~nondet12; [L46] havoc #t~nondet12; [L47] COND FALSE !(0 == ~cond~0) [L50] ~lk1~0 := 0; [L52] ~lk2~0 := 0; [L54] ~lk3~0 := 0; [L56] ~lk4~0 := 0; [L58] ~lk5~0 := 0; [L60] ~lk6~0 := 0; [L62] ~lk7~0 := 0; [L64] ~lk8~0 := 0; [L66] ~lk9~0 := 0; [L68] ~lk10~0 := 0; [L70] ~lk11~0 := 0; [L72] ~lk12~0 := 0; [L76] COND FALSE !(0 != ~p1~0) [L80] COND FALSE !(0 != ~p2~0) [L84] COND FALSE !(0 != ~p3~0) [L88] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L96] COND FALSE !(0 != ~p6~0) [L100] COND FALSE !(0 != ~p7~0) [L104] COND FALSE !(0 != ~p8~0) [L108] COND FALSE !(0 != ~p9~0) [L112] COND FALSE !(0 != ~p10~0) [L116] COND FALSE !(0 != ~p11~0) [L120] COND FALSE !(0 != ~p12~0) [L126] COND FALSE !(0 != ~p1~0) [L131] COND FALSE !(0 != ~p2~0) [L136] COND FALSE !(0 != ~p3~0) [L141] COND FALSE !(0 != ~p4~0) [L146] COND FALSE !(0 != ~p5~0) [L151] COND FALSE !(0 != ~p6~0) [L156] COND FALSE !(0 != ~p7~0) [L161] COND FALSE !(0 != ~p8~0) [L166] COND FALSE !(0 != ~p9~0) [L171] COND FALSE !(0 != ~p10~0) [L176] COND FALSE !(0 != ~p11~0) [L181] COND FALSE !(0 != ~p12~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L45-L186] COND FALSE !(false) [L46] ~cond~0 := #t~nondet12; [L46] havoc #t~nondet12; [L47] COND FALSE !(0 == ~cond~0) [L50] ~lk1~0 := 0; [L52] ~lk2~0 := 0; [L54] ~lk3~0 := 0; [L56] ~lk4~0 := 0; [L58] ~lk5~0 := 0; [L60] ~lk6~0 := 0; [L62] ~lk7~0 := 0; [L64] ~lk8~0 := 0; [L66] ~lk9~0 := 0; [L68] ~lk10~0 := 0; [L70] ~lk11~0 := 0; [L72] ~lk12~0 := 0; [L76] COND FALSE !(0 != ~p1~0) [L80] COND FALSE !(0 != ~p2~0) [L84] COND FALSE !(0 != ~p3~0) [L88] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L96] COND FALSE !(0 != ~p6~0) [L100] COND FALSE !(0 != ~p7~0) [L104] COND FALSE !(0 != ~p8~0) [L108] COND FALSE !(0 != ~p9~0) [L112] COND FALSE !(0 != ~p10~0) [L116] COND FALSE !(0 != ~p11~0) [L120] COND FALSE !(0 != ~p12~0) [L126] COND FALSE !(0 != ~p1~0) [L131] COND FALSE !(0 != ~p2~0) [L136] COND FALSE !(0 != ~p3~0) [L141] COND FALSE !(0 != ~p4~0) [L146] COND FALSE !(0 != ~p5~0) [L151] COND FALSE !(0 != ~p6~0) [L156] COND FALSE !(0 != ~p7~0) [L161] COND FALSE !(0 != ~p8~0) [L166] COND FALSE !(0 != ~p9~0) [L171] COND FALSE !(0 != ~p10~0) [L176] COND FALSE !(0 != ~p11~0) [L181] COND FALSE !(0 != ~p12~0) [L45] COND TRUE 1 [L46] cond = __VERIFIER_nondet_int() [L47] COND FALSE !(cond == 0) [L50] lk1 = 0 [L52] lk2 = 0 [L54] lk3 = 0 [L56] lk4 = 0 [L58] lk5 = 0 [L60] lk6 = 0 [L62] lk7 = 0 [L64] lk8 = 0 [L66] lk9 = 0 [L68] lk10 = 0 [L70] lk11 = 0 [L72] lk12 = 0 [L76] COND FALSE !(p1 != 0) [L80] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L88] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L96] COND FALSE !(p6 != 0) [L100] COND FALSE !(p7 != 0) [L104] COND FALSE !(p8 != 0) [L108] COND FALSE !(p9 != 0) [L112] COND FALSE !(p10 != 0) [L116] COND FALSE !(p11 != 0) [L120] COND FALSE !(p12 != 0) [L126] COND FALSE !(p1 != 0) [L131] COND FALSE !(p2 != 0) [L136] COND FALSE !(p3 != 0) [L141] COND FALSE !(p4 != 0) [L146] COND FALSE !(p5 != 0) [L151] COND FALSE !(p6 != 0) [L156] COND FALSE !(p7 != 0) [L161] COND FALSE !(p8 != 0) [L166] COND FALSE !(p9 != 0) [L171] COND FALSE !(p10 != 0) [L176] COND FALSE !(p11 != 0) [L181] COND FALSE !(p12 != 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L30] main_~p9~0 := main_#t~nondet8; [L30] havoc main_#t~nondet8; [L31] havoc main_~lk9~0; [L33] main_~p10~0 := main_#t~nondet9; [L33] havoc main_#t~nondet9; [L34] havoc main_~lk10~0; [L36] main_~p11~0 := main_#t~nondet10; [L36] havoc main_#t~nondet10; [L37] havoc main_~lk11~0; [L39] main_~p12~0 := main_#t~nondet11; [L39] havoc main_#t~nondet11; [L40] havoc main_~lk12~0; [L43] havoc main_~cond~0; [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L30] ~p9~0 := #t~nondet8; [L30] havoc #t~nondet8; [L31] havoc ~lk9~0; [L33] ~p10~0 := #t~nondet9; [L33] havoc #t~nondet9; [L34] havoc ~lk10~0; [L36] ~p11~0 := #t~nondet10; [L36] havoc #t~nondet10; [L37] havoc ~lk11~0; [L39] ~p12~0 := #t~nondet11; [L39] havoc #t~nondet11; [L40] havoc ~lk12~0; [L43] havoc ~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L30] ~p9~0 := #t~nondet8; [L30] havoc #t~nondet8; [L31] havoc ~lk9~0; [L33] ~p10~0 := #t~nondet9; [L33] havoc #t~nondet9; [L34] havoc ~lk10~0; [L36] ~p11~0 := #t~nondet10; [L36] havoc #t~nondet10; [L37] havoc ~lk11~0; [L39] ~p12~0 := #t~nondet11; [L39] havoc #t~nondet11; [L40] havoc ~lk12~0; [L43] havoc ~cond~0; [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L43] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; [?] assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [?] assume !(0 != main_~p8~0); [?] assume !(0 != main_~p9~0); [?] assume !(0 != main_~p10~0); [?] assume !(0 != main_~p11~0); [?] assume !(0 != main_~p12~0); [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [?] assume !(0 != main_~p8~0); [?] assume !(0 != main_~p9~0); [?] assume !(0 != main_~p10~0); [?] assume !(0 != main_~p11~0); [?] assume !(0 != main_~p12~0); [L45-L186] assume !false; [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47-L49] assume !(0 == main_~cond~0); [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76-L78] assume !(0 != main_~p1~0); [L80-L82] assume !(0 != main_~p2~0); [L84-L86] assume !(0 != main_~p3~0); [L88-L90] assume !(0 != main_~p4~0); [L92-L94] assume !(0 != main_~p5~0); [L96-L98] assume !(0 != main_~p6~0); [L100-L102] assume !(0 != main_~p7~0); [L104-L106] assume !(0 != main_~p8~0); [L108-L110] assume !(0 != main_~p9~0); [L112-L114] assume !(0 != main_~p10~0); [L116-L118] assume !(0 != main_~p11~0); [L120-L122] assume !(0 != main_~p12~0); [L126-L129] assume !(0 != main_~p1~0); [L131-L134] assume !(0 != main_~p2~0); [L136-L139] assume !(0 != main_~p3~0); [L141-L144] assume !(0 != main_~p4~0); [L146-L149] assume !(0 != main_~p5~0); [L151-L154] assume !(0 != main_~p6~0); [L156-L159] assume !(0 != main_~p7~0); [L161-L164] assume !(0 != main_~p8~0); [L166-L169] assume !(0 != main_~p9~0); [L171-L174] assume !(0 != main_~p10~0); [L176-L179] assume !(0 != main_~p11~0); [L181-L184] assume !(0 != main_~p12~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L45-L186] assume !false; [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47-L49] assume !(0 == main_~cond~0); [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76-L78] assume !(0 != main_~p1~0); [L80-L82] assume !(0 != main_~p2~0); [L84-L86] assume !(0 != main_~p3~0); [L88-L90] assume !(0 != main_~p4~0); [L92-L94] assume !(0 != main_~p5~0); [L96-L98] assume !(0 != main_~p6~0); [L100-L102] assume !(0 != main_~p7~0); [L104-L106] assume !(0 != main_~p8~0); [L108-L110] assume !(0 != main_~p9~0); [L112-L114] assume !(0 != main_~p10~0); [L116-L118] assume !(0 != main_~p11~0); [L120-L122] assume !(0 != main_~p12~0); [L126-L129] assume !(0 != main_~p1~0); [L131-L134] assume !(0 != main_~p2~0); [L136-L139] assume !(0 != main_~p3~0); [L141-L144] assume !(0 != main_~p4~0); [L146-L149] assume !(0 != main_~p5~0); [L151-L154] assume !(0 != main_~p6~0); [L156-L159] assume !(0 != main_~p7~0); [L161-L164] assume !(0 != main_~p8~0); [L166-L169] assume !(0 != main_~p9~0); [L171-L174] assume !(0 != main_~p10~0); [L176-L179] assume !(0 != main_~p11~0); [L181-L184] assume !(0 != main_~p12~0); [L45-L186] COND FALSE !(false) [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47] COND FALSE !(0 == main_~cond~0) [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76] COND FALSE !(0 != main_~p1~0) [L80] COND FALSE !(0 != main_~p2~0) [L84] COND FALSE !(0 != main_~p3~0) [L88] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L96] COND FALSE !(0 != main_~p6~0) [L100] COND FALSE !(0 != main_~p7~0) [L104] COND FALSE !(0 != main_~p8~0) [L108] COND FALSE !(0 != main_~p9~0) [L112] COND FALSE !(0 != main_~p10~0) [L116] COND FALSE !(0 != main_~p11~0) [L120] COND FALSE !(0 != main_~p12~0) [L126] COND FALSE !(0 != main_~p1~0) [L131] COND FALSE !(0 != main_~p2~0) [L136] COND FALSE !(0 != main_~p3~0) [L141] COND FALSE !(0 != main_~p4~0) [L146] COND FALSE !(0 != main_~p5~0) [L151] COND FALSE !(0 != main_~p6~0) [L156] COND FALSE !(0 != main_~p7~0) [L161] COND FALSE !(0 != main_~p8~0) [L166] COND FALSE !(0 != main_~p9~0) [L171] COND FALSE !(0 != main_~p10~0) [L176] COND FALSE !(0 != main_~p11~0) [L181] COND FALSE !(0 != main_~p12~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L45-L186] COND FALSE !(false) [L46] main_~cond~0 := main_#t~nondet12; [L46] havoc main_#t~nondet12; [L47] COND FALSE !(0 == main_~cond~0) [L50] main_~lk1~0 := 0; [L52] main_~lk2~0 := 0; [L54] main_~lk3~0 := 0; [L56] main_~lk4~0 := 0; [L58] main_~lk5~0 := 0; [L60] main_~lk6~0 := 0; [L62] main_~lk7~0 := 0; [L64] main_~lk8~0 := 0; [L66] main_~lk9~0 := 0; [L68] main_~lk10~0 := 0; [L70] main_~lk11~0 := 0; [L72] main_~lk12~0 := 0; [L76] COND FALSE !(0 != main_~p1~0) [L80] COND FALSE !(0 != main_~p2~0) [L84] COND FALSE !(0 != main_~p3~0) [L88] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L96] COND FALSE !(0 != main_~p6~0) [L100] COND FALSE !(0 != main_~p7~0) [L104] COND FALSE !(0 != main_~p8~0) [L108] COND FALSE !(0 != main_~p9~0) [L112] COND FALSE !(0 != main_~p10~0) [L116] COND FALSE !(0 != main_~p11~0) [L120] COND FALSE !(0 != main_~p12~0) [L126] COND FALSE !(0 != main_~p1~0) [L131] COND FALSE !(0 != main_~p2~0) [L136] COND FALSE !(0 != main_~p3~0) [L141] COND FALSE !(0 != main_~p4~0) [L146] COND FALSE !(0 != main_~p5~0) [L151] COND FALSE !(0 != main_~p6~0) [L156] COND FALSE !(0 != main_~p7~0) [L161] COND FALSE !(0 != main_~p8~0) [L166] COND FALSE !(0 != main_~p9~0) [L171] COND FALSE !(0 != main_~p10~0) [L176] COND FALSE !(0 != main_~p11~0) [L181] COND FALSE !(0 != main_~p12~0) [L45-L186] COND FALSE !(false) [L46] ~cond~0 := #t~nondet12; [L46] havoc #t~nondet12; [L47] COND FALSE !(0 == ~cond~0) [L50] ~lk1~0 := 0; [L52] ~lk2~0 := 0; [L54] ~lk3~0 := 0; [L56] ~lk4~0 := 0; [L58] ~lk5~0 := 0; [L60] ~lk6~0 := 0; [L62] ~lk7~0 := 0; [L64] ~lk8~0 := 0; [L66] ~lk9~0 := 0; [L68] ~lk10~0 := 0; [L70] ~lk11~0 := 0; [L72] ~lk12~0 := 0; [L76] COND FALSE !(0 != ~p1~0) [L80] COND FALSE !(0 != ~p2~0) [L84] COND FALSE !(0 != ~p3~0) [L88] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L96] COND FALSE !(0 != ~p6~0) [L100] COND FALSE !(0 != ~p7~0) [L104] COND FALSE !(0 != ~p8~0) [L108] COND FALSE !(0 != ~p9~0) [L112] COND FALSE !(0 != ~p10~0) [L116] COND FALSE !(0 != ~p11~0) [L120] COND FALSE !(0 != ~p12~0) [L126] COND FALSE !(0 != ~p1~0) [L131] COND FALSE !(0 != ~p2~0) [L136] COND FALSE !(0 != ~p3~0) [L141] COND FALSE !(0 != ~p4~0) [L146] COND FALSE !(0 != ~p5~0) [L151] COND FALSE !(0 != ~p6~0) [L156] COND FALSE !(0 != ~p7~0) [L161] COND FALSE !(0 != ~p8~0) [L166] COND FALSE !(0 != ~p9~0) [L171] COND FALSE !(0 != ~p10~0) [L176] COND FALSE !(0 != ~p11~0) [L181] COND FALSE !(0 != ~p12~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L45-L186] COND FALSE !(false) [L46] ~cond~0 := #t~nondet12; [L46] havoc #t~nondet12; [L47] COND FALSE !(0 == ~cond~0) [L50] ~lk1~0 := 0; [L52] ~lk2~0 := 0; [L54] ~lk3~0 := 0; [L56] ~lk4~0 := 0; [L58] ~lk5~0 := 0; [L60] ~lk6~0 := 0; [L62] ~lk7~0 := 0; [L64] ~lk8~0 := 0; [L66] ~lk9~0 := 0; [L68] ~lk10~0 := 0; [L70] ~lk11~0 := 0; [L72] ~lk12~0 := 0; [L76] COND FALSE !(0 != ~p1~0) [L80] COND FALSE !(0 != ~p2~0) [L84] COND FALSE !(0 != ~p3~0) [L88] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L96] COND FALSE !(0 != ~p6~0) [L100] COND FALSE !(0 != ~p7~0) [L104] COND FALSE !(0 != ~p8~0) [L108] COND FALSE !(0 != ~p9~0) [L112] COND FALSE !(0 != ~p10~0) [L116] COND FALSE !(0 != ~p11~0) [L120] COND FALSE !(0 != ~p12~0) [L126] COND FALSE !(0 != ~p1~0) [L131] COND FALSE !(0 != ~p2~0) [L136] COND FALSE !(0 != ~p3~0) [L141] COND FALSE !(0 != ~p4~0) [L146] COND FALSE !(0 != ~p5~0) [L151] COND FALSE !(0 != ~p6~0) [L156] COND FALSE !(0 != ~p7~0) [L161] COND FALSE !(0 != ~p8~0) [L166] COND FALSE !(0 != ~p9~0) [L171] COND FALSE !(0 != ~p10~0) [L176] COND FALSE !(0 != ~p11~0) [L181] COND FALSE !(0 != ~p12~0) [L45] COND TRUE 1 [L46] cond = __VERIFIER_nondet_int() [L47] COND FALSE !(cond == 0) [L50] lk1 = 0 [L52] lk2 = 0 [L54] lk3 = 0 [L56] lk4 = 0 [L58] lk5 = 0 [L60] lk6 = 0 [L62] lk7 = 0 [L64] lk8 = 0 [L66] lk9 = 0 [L68] lk10 = 0 [L70] lk11 = 0 [L72] lk12 = 0 [L76] COND FALSE !(p1 != 0) [L80] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L88] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L96] COND FALSE !(p6 != 0) [L100] COND FALSE !(p7 != 0) [L104] COND FALSE !(p8 != 0) [L108] COND FALSE !(p9 != 0) [L112] COND FALSE !(p10 != 0) [L116] COND FALSE !(p11 != 0) [L120] COND FALSE !(p12 != 0) [L126] COND FALSE !(p1 != 0) [L131] COND FALSE !(p2 != 0) [L136] COND FALSE !(p3 != 0) [L141] COND FALSE !(p4 != 0) [L146] COND FALSE !(p5 != 0) [L151] COND FALSE !(p6 != 0) [L156] COND FALSE !(p7 != 0) [L161] COND FALSE !(p8 != 0) [L166] COND FALSE !(p9 != 0) [L171] COND FALSE !(p10 != 0) [L176] COND FALSE !(p11 != 0) [L181] COND FALSE !(p12 != 0) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L43] int cond; Loop: [L45] COND TRUE 1 [L46] cond = __VERIFIER_nondet_int() [L47] COND FALSE !(cond == 0) [L50] lk1 = 0 [L52] lk2 = 0 [L54] lk3 = 0 [L56] lk4 = 0 [L58] lk5 = 0 [L60] lk6 = 0 [L62] lk7 = 0 [L64] lk8 = 0 [L66] lk9 = 0 [L68] lk10 = 0 [L70] lk11 = 0 [L72] lk12 = 0 [L76] COND FALSE !(p1 != 0) [L80] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L88] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L96] COND FALSE !(p6 != 0) [L100] COND FALSE !(p7 != 0) [L104] COND FALSE !(p8 != 0) [L108] COND FALSE !(p9 != 0) [L112] COND FALSE !(p10 != 0) [L116] COND FALSE !(p11 != 0) [L120] COND FALSE !(p12 != 0) [L126] COND FALSE !(p1 != 0) [L131] COND FALSE !(p2 != 0) [L136] COND FALSE !(p3 != 0) [L141] COND FALSE !(p4 != 0) [L146] COND FALSE !(p5 != 0) [L151] COND FALSE !(p6 != 0) [L156] COND FALSE !(p7 != 0) [L161] COND FALSE !(p8 != 0) [L166] COND FALSE !(p9 != 0) [L171] COND FALSE !(p10 != 0) [L176] COND FALSE !(p11 != 0) [L181] COND FALSE !(p12 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...