./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_46793188-1035-4528-8f49-1558a93d7f55/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_46793188-1035-4528-8f49-1558a93d7f55/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_46793188-1035-4528-8f49-1558a93d7f55/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_46793188-1035-4528-8f49-1558a93d7f55/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_46793188-1035-4528-8f49-1558a93d7f55/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_46793188-1035-4528-8f49-1558a93d7f55/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 fc492c809d432e4c3053fa8c39191c1c15ea4eea ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 14:57:49,290 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:57:49,291 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:57:49,297 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:57:49,298 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:57:49,298 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:57:49,299 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:57:49,300 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:57:49,301 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:57:49,302 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:57:49,303 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:57:49,303 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:57:49,303 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:57:49,304 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:57:49,304 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:57:49,305 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:57:49,305 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:57:49,306 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:57:49,308 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:57:49,309 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:57:49,309 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:57:49,310 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:57:49,312 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:57:49,312 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:57:49,312 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:57:49,313 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:57:49,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:57:49,313 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:57:49,314 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:57:49,315 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:57:49,315 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:57:49,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:57:49,316 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:57:49,316 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:57:49,316 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:57:49,317 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:57:49,317 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_46793188-1035-4528-8f49-1558a93d7f55/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 14:57:49,326 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:57:49,326 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:57:49,327 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:57:49,327 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:57:49,327 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:57:49,327 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 14:57:49,328 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 14:57:49,328 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 14:57:49,328 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 14:57:49,328 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 14:57:49,328 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 14:57:49,328 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:57:49,328 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:57:49,328 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 14:57:49,329 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:57:49,329 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:57:49,329 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:57:49,329 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 14:57:49,329 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 14:57:49,329 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 14:57:49,329 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:57:49,329 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:57:49,330 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 14:57:49,330 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:57:49,330 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 14:57:49,330 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:57:49,330 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:57:49,330 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 14:57:49,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:57:49,331 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:57:49,331 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 14:57:49,331 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 14:57:49,332 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_46793188-1035-4528-8f49-1558a93d7f55/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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2018-11-18 14:57:49,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:57:49,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:57:49,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:57:49,369 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:57:49,369 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:57:49,370 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_46793188-1035-4528-8f49-1558a93d7f55/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:57:49,415 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46793188-1035-4528-8f49-1558a93d7f55/bin-2019/uautomizer/data/3b0298338/f94ae9c2f56649fa86c62b1aec775d2f/FLAGdb5f626b5 [2018-11-18 14:57:49,818 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:57:49,818 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_46793188-1035-4528-8f49-1558a93d7f55/sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:57:49,823 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46793188-1035-4528-8f49-1558a93d7f55/bin-2019/uautomizer/data/3b0298338/f94ae9c2f56649fa86c62b1aec775d2f/FLAGdb5f626b5 [2018-11-18 14:57:49,833 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_46793188-1035-4528-8f49-1558a93d7f55/bin-2019/uautomizer/data/3b0298338/f94ae9c2f56649fa86c62b1aec775d2f [2018-11-18 14:57:49,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:57:49,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:57:49,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:57:49,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:57:49,840 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:57:49,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:57:49" (1/1) ... [2018-11-18 14:57:49,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411459c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:57:49, skipping insertion in model container [2018-11-18 14:57:49,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:57:49" (1/1) ... [2018-11-18 14:57:49,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:57:49,867 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:57:49,978 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:57:49,981 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:57:49,995 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:57:50,004 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:57:50,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:57:50 WrapperNode [2018-11-18 14:57:50,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:57:50,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:57:50,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:57:50,005 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:57:50,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:57:50" (1/1) ... [2018-11-18 14:57:50,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:57:50" (1/1) ... [2018-11-18 14:57:50,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:57:50,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:57:50,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:57:50,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:57:50,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:57:50" (1/1) ... [2018-11-18 14:57:50,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:57:50" (1/1) ... [2018-11-18 14:57:50,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:57:50" (1/1) ... [2018-11-18 14:57:50,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:57:50" (1/1) ... [2018-11-18 14:57:50,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:57:50" (1/1) ... [2018-11-18 14:57:50,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:57:50" (1/1) ... [2018-11-18 14:57:50,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:57:50" (1/1) ... [2018-11-18 14:57:50,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:57:50,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:57:50,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:57:50,074 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:57:50,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:57:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46793188-1035-4528-8f49-1558a93d7f55/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-18 14:57:50,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:57:50,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:57:50,230 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:57:50,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:57:50 BoogieIcfgContainer [2018-11-18 14:57:50,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:57:50,231 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 14:57:50,231 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 14:57:50,234 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 14:57:50,234 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:57:50,235 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 02:57:49" (1/3) ... [2018-11-18 14:57:50,235 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@148d268f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:57:50, skipping insertion in model container [2018-11-18 14:57:50,236 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:57:50,236 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:57:50" (2/3) ... [2018-11-18 14:57:50,236 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@148d268f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:57:50, skipping insertion in model container [2018-11-18 14:57:50,236 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:57:50,236 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:57:50" (3/3) ... [2018-11-18 14:57:50,238 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:57:50,281 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:57:50,282 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 14:57:50,282 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 14:57:50,282 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 14:57:50,282 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:57:50,282 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:57:50,282 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 14:57:50,282 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:57:50,282 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 14:57:50,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-18 14:57:50,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-18 14:57:50,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:57:50,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:57:50,319 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:57:50,319 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:57:50,319 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 14:57:50,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-18 14:57:50,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-18 14:57:50,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:57:50,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:57:50,321 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:57:50,321 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:57:50,326 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~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_~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;havoc main_~cond~0; 25#L97-1true [2018-11-18 14:57:50,326 INFO L796 eck$LassoCheckResult]: Loop: 25#L97-1true assume true; 3#L27-1true assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 5#L29true 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; 30#L46true assume 0 != main_~p1~0;main_~lk1~0 := 1; 27#L46-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 19#L50-1true assume 0 != main_~p3~0;main_~lk3~0 := 1; 10#L54-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 17#L58-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 6#L62-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 26#L66-1true assume !(0 != main_~p1~0); 21#L72-1true assume !(0 != main_~p2~0); 28#L77-1true assume !(0 != main_~p3~0); 4#L82-1true assume !(0 != main_~p4~0); 11#L87-1true assume !(0 != main_~p5~0); 18#L92-1true assume !(0 != main_~p6~0); 25#L97-1true [2018-11-18 14:57:50,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,330 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 14:57:50,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:57:50,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1302883133, now seen corresponding path program 1 times [2018-11-18 14:57:50,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:57:50,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:57:50,437 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-18 14:57:50,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:57:50,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:57:50,442 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:57:50,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:57:50,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:57:50,452 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2018-11-18 14:57:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:57:50,477 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2018-11-18 14:57:50,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:57:50,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 84 transitions. [2018-11-18 14:57:50,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-18 14:57:50,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 43 states and 65 transitions. [2018-11-18 14:57:50,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-18 14:57:50,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-18 14:57:50,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 65 transitions. [2018-11-18 14:57:50,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:57:50,486 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 65 transitions. [2018-11-18 14:57:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 65 transitions. [2018-11-18 14:57:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-18 14:57:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 14:57:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 65 transitions. [2018-11-18 14:57:50,507 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 65 transitions. [2018-11-18 14:57:50,507 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 65 transitions. [2018-11-18 14:57:50,507 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 14:57:50,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 65 transitions. [2018-11-18 14:57:50,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-18 14:57:50,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:57:50,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:57:50,509 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:57:50,509 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:57:50,510 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 110#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~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_~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;havoc main_~cond~0; 111#L97-1 [2018-11-18 14:57:50,510 INFO L796 eck$LassoCheckResult]: Loop: 111#L97-1 assume true; 119#L27-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 118#L29 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; 116#L46 assume !(0 != main_~p1~0); 117#L46-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 132#L50-1 assume 0 != main_~p3~0;main_~lk3~0 := 1; 131#L54-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 130#L58-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 129#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 128#L66-1 assume !(0 != main_~p1~0); 100#L72-1 assume !(0 != main_~p2~0); 102#L77-1 assume !(0 != main_~p3~0); 95#L82-1 assume !(0 != main_~p4~0); 96#L87-1 assume !(0 != main_~p5~0); 121#L92-1 assume !(0 != main_~p6~0); 111#L97-1 [2018-11-18 14:57:50,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,510 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 14:57:50,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:57:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1561048571, now seen corresponding path program 1 times [2018-11-18 14:57:50,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:57:50,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:57:50,537 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-18 14:57:50,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:57:50,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:57:50,538 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:57:50,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:57:50,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:57:50,539 INFO L87 Difference]: Start difference. First operand 43 states and 65 transitions. cyclomatic complexity: 24 Second operand 3 states. [2018-11-18 14:57:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:57:50,552 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2018-11-18 14:57:50,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:57:50,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 122 transitions. [2018-11-18 14:57:50,555 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 80 [2018-11-18 14:57:50,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 122 transitions. [2018-11-18 14:57:50,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2018-11-18 14:57:50,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2018-11-18 14:57:50,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 122 transitions. [2018-11-18 14:57:50,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:57:50,557 INFO L705 BuchiCegarLoop]: Abstraction has 82 states and 122 transitions. [2018-11-18 14:57:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 122 transitions. [2018-11-18 14:57:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-18 14:57:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 14:57:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 122 transitions. [2018-11-18 14:57:50,562 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 122 transitions. [2018-11-18 14:57:50,563 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 122 transitions. [2018-11-18 14:57:50,563 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 14:57:50,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 122 transitions. [2018-11-18 14:57:50,564 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 80 [2018-11-18 14:57:50,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:57:50,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:57:50,564 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:57:50,564 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:57:50,565 INFO L794 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 240#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~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_~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;havoc main_~cond~0; 241#L97-1 [2018-11-18 14:57:50,565 INFO L796 eck$LassoCheckResult]: Loop: 241#L97-1 assume true; 263#L27-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 262#L29 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; 260#L46 assume !(0 != main_~p1~0); 259#L46-2 assume !(0 != main_~p2~0); 258#L50-1 assume 0 != main_~p3~0;main_~lk3~0 := 1; 257#L54-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 256#L58-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 255#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 252#L66-1 assume !(0 != main_~p1~0); 253#L72-1 assume !(0 != main_~p2~0); 281#L77-1 assume !(0 != main_~p3~0); 276#L82-1 assume !(0 != main_~p4~0); 274#L87-1 assume !(0 != main_~p5~0); 271#L92-1 assume !(0 != main_~p6~0); 241#L97-1 [2018-11-18 14:57:50,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,565 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 14:57:50,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:57:50,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2032854147, now seen corresponding path program 1 times [2018-11-18 14:57:50,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:57:50,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:57:50,591 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-18 14:57:50,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:57:50,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:57:50,591 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:57:50,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:57:50,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:57:50,592 INFO L87 Difference]: Start difference. First operand 82 states and 122 transitions. cyclomatic complexity: 44 Second operand 3 states. [2018-11-18 14:57:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:57:50,604 INFO L93 Difference]: Finished difference Result 158 states and 230 transitions. [2018-11-18 14:57:50,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:57:50,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 230 transitions. [2018-11-18 14:57:50,605 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 156 [2018-11-18 14:57:50,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 158 states and 230 transitions. [2018-11-18 14:57:50,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2018-11-18 14:57:50,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2018-11-18 14:57:50,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 230 transitions. [2018-11-18 14:57:50,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:57:50,607 INFO L705 BuchiCegarLoop]: Abstraction has 158 states and 230 transitions. [2018-11-18 14:57:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 230 transitions. [2018-11-18 14:57:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-11-18 14:57:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-18 14:57:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 230 transitions. [2018-11-18 14:57:50,613 INFO L728 BuchiCegarLoop]: Abstraction has 158 states and 230 transitions. [2018-11-18 14:57:50,613 INFO L608 BuchiCegarLoop]: Abstraction has 158 states and 230 transitions. [2018-11-18 14:57:50,613 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 14:57:50,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 230 transitions. [2018-11-18 14:57:50,619 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 156 [2018-11-18 14:57:50,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:57:50,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:57:50,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:57:50,619 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:57:50,620 INFO L794 eck$LassoCheckResult]: Stem: 490#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 487#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~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_~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;havoc main_~cond~0; 488#L97-1 [2018-11-18 14:57:50,620 INFO L796 eck$LassoCheckResult]: Loop: 488#L97-1 assume true; 524#L27-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 522#L29 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; 519#L46 assume !(0 != main_~p1~0); 515#L46-2 assume !(0 != main_~p2~0); 512#L50-1 assume !(0 != main_~p3~0); 508#L54-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 509#L58-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 504#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 505#L66-1 assume !(0 != main_~p1~0); 541#L72-1 assume !(0 != main_~p2~0); 539#L77-1 assume !(0 != main_~p3~0); 536#L82-1 assume !(0 != main_~p4~0); 533#L87-1 assume !(0 != main_~p5~0); 529#L92-1 assume !(0 != main_~p6~0); 488#L97-1 [2018-11-18 14:57:50,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,620 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 14:57:50,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:57:50,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1869086139, now seen corresponding path program 1 times [2018-11-18 14:57:50,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:57:50,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:57:50,640 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-18 14:57:50,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:57:50,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:57:50,640 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:57:50,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:57:50,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:57:50,640 INFO L87 Difference]: Start difference. First operand 158 states and 230 transitions. cyclomatic complexity: 80 Second operand 3 states. [2018-11-18 14:57:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:57:50,666 INFO L93 Difference]: Finished difference Result 306 states and 434 transitions. [2018-11-18 14:57:50,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:57:50,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 306 states and 434 transitions. [2018-11-18 14:57:50,668 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 304 [2018-11-18 14:57:50,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 306 states to 306 states and 434 transitions. [2018-11-18 14:57:50,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2018-11-18 14:57:50,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-11-18 14:57:50,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 434 transitions. [2018-11-18 14:57:50,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:57:50,672 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 434 transitions. [2018-11-18 14:57:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 434 transitions. [2018-11-18 14:57:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2018-11-18 14:57:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-11-18 14:57:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 434 transitions. [2018-11-18 14:57:50,689 INFO L728 BuchiCegarLoop]: Abstraction has 306 states and 434 transitions. [2018-11-18 14:57:50,689 INFO L608 BuchiCegarLoop]: Abstraction has 306 states and 434 transitions. [2018-11-18 14:57:50,689 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 14:57:50,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 306 states and 434 transitions. [2018-11-18 14:57:50,691 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 304 [2018-11-18 14:57:50,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:57:50,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:57:50,691 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:57:50,691 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:57:50,692 INFO L794 eck$LassoCheckResult]: Stem: 957#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 954#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~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_~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;havoc main_~cond~0; 955#L97-1 [2018-11-18 14:57:50,692 INFO L796 eck$LassoCheckResult]: Loop: 955#L97-1 assume true; 1009#L27-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 1005#L29 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; 1000#L46 assume !(0 != main_~p1~0); 993#L46-2 assume !(0 != main_~p2~0); 985#L50-1 assume !(0 != main_~p3~0); 986#L54-1 assume !(0 != main_~p4~0); 1055#L58-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1053#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1049#L66-1 assume !(0 != main_~p1~0); 1042#L72-1 assume !(0 != main_~p2~0); 1037#L77-1 assume !(0 != main_~p3~0); 1033#L82-1 assume !(0 != main_~p4~0); 1031#L87-1 assume !(0 != main_~p5~0); 1022#L92-1 assume !(0 != main_~p6~0); 955#L97-1 [2018-11-18 14:57:50,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,692 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 14:57:50,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:57:50,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1745822787, now seen corresponding path program 1 times [2018-11-18 14:57:50,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:57:50,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:57:50,706 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-18 14:57:50,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:57:50,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:57:50,706 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:57:50,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:57:50,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:57:50,707 INFO L87 Difference]: Start difference. First operand 306 states and 434 transitions. cyclomatic complexity: 144 Second operand 3 states. [2018-11-18 14:57:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:57:50,719 INFO L93 Difference]: Finished difference Result 594 states and 818 transitions. [2018-11-18 14:57:50,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:57:50,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 594 states and 818 transitions. [2018-11-18 14:57:50,723 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 592 [2018-11-18 14:57:50,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 594 states to 594 states and 818 transitions. [2018-11-18 14:57:50,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 594 [2018-11-18 14:57:50,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 594 [2018-11-18 14:57:50,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 594 states and 818 transitions. [2018-11-18 14:57:50,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:57:50,728 INFO L705 BuchiCegarLoop]: Abstraction has 594 states and 818 transitions. [2018-11-18 14:57:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states and 818 transitions. [2018-11-18 14:57:50,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2018-11-18 14:57:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-18 14:57:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 818 transitions. [2018-11-18 14:57:50,743 INFO L728 BuchiCegarLoop]: Abstraction has 594 states and 818 transitions. [2018-11-18 14:57:50,744 INFO L608 BuchiCegarLoop]: Abstraction has 594 states and 818 transitions. [2018-11-18 14:57:50,744 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 14:57:50,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 594 states and 818 transitions. [2018-11-18 14:57:50,746 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 592 [2018-11-18 14:57:50,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:57:50,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:57:50,747 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:57:50,747 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:57:50,747 INFO L794 eck$LassoCheckResult]: Stem: 1867#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1863#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~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_~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;havoc main_~cond~0; 1864#L97-1 [2018-11-18 14:57:50,747 INFO L796 eck$LassoCheckResult]: Loop: 1864#L97-1 assume true; 1968#L27-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 1966#L29 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; 1963#L46 assume !(0 != main_~p1~0); 1956#L46-2 assume !(0 != main_~p2~0); 1958#L50-1 assume !(0 != main_~p3~0); 1937#L54-1 assume !(0 != main_~p4~0); 1939#L58-1 assume !(0 != main_~p5~0); 1919#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1920#L66-1 assume !(0 != main_~p1~0); 1985#L72-1 assume !(0 != main_~p2~0); 1983#L77-1 assume !(0 != main_~p3~0); 1979#L82-1 assume !(0 != main_~p4~0); 1975#L87-1 assume !(0 != main_~p5~0); 1972#L92-1 assume !(0 != main_~p6~0); 1864#L97-1 [2018-11-18 14:57:50,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,748 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 14:57:50,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:57:50,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1739797883, now seen corresponding path program 1 times [2018-11-18 14:57:50,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:57:50,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:57:50,775 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-18 14:57:50,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:57:50,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 14:57:50,775 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:57:50,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:57:50,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:57:50,776 INFO L87 Difference]: Start difference. First operand 594 states and 818 transitions. cyclomatic complexity: 256 Second operand 3 states. [2018-11-18 14:57:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:57:50,791 INFO L93 Difference]: Finished difference Result 1154 states and 1538 transitions. [2018-11-18 14:57:50,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:57:50,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1538 transitions. [2018-11-18 14:57:50,796 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1152 [2018-11-18 14:57:50,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1538 transitions. [2018-11-18 14:57:50,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2018-11-18 14:57:50,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2018-11-18 14:57:50,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1538 transitions. [2018-11-18 14:57:50,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:57:50,801 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1538 transitions. [2018-11-18 14:57:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1538 transitions. [2018-11-18 14:57:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1154. [2018-11-18 14:57:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2018-11-18 14:57:50,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1538 transitions. [2018-11-18 14:57:50,812 INFO L728 BuchiCegarLoop]: Abstraction has 1154 states and 1538 transitions. [2018-11-18 14:57:50,813 INFO L608 BuchiCegarLoop]: Abstraction has 1154 states and 1538 transitions. [2018-11-18 14:57:50,813 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 14:57:50,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1154 states and 1538 transitions. [2018-11-18 14:57:50,817 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1152 [2018-11-18 14:57:50,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:57:50,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:57:50,817 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:57:50,817 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:57:50,818 INFO L794 eck$LassoCheckResult]: Stem: 3619#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3616#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~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_~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;havoc main_~cond~0; 3617#L97-1 [2018-11-18 14:57:50,818 INFO L796 eck$LassoCheckResult]: Loop: 3617#L97-1 assume true; 3792#L27-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 3790#L29 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; 3786#L46 assume !(0 != main_~p1~0); 3783#L46-2 assume !(0 != main_~p2~0); 3781#L50-1 assume !(0 != main_~p3~0); 3744#L54-1 assume !(0 != main_~p4~0); 3745#L58-1 assume !(0 != main_~p5~0); 3775#L62-1 assume !(0 != main_~p6~0); 3772#L66-1 assume !(0 != main_~p1~0); 3770#L72-1 assume !(0 != main_~p2~0); 3768#L77-1 assume !(0 != main_~p3~0); 3766#L82-1 assume !(0 != main_~p4~0); 3767#L87-1 assume !(0 != main_~p5~0); 3795#L92-1 assume !(0 != main_~p6~0); 3617#L97-1 [2018-11-18 14:57:50,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,818 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 14:57:50,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:57:50,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,822 INFO L82 PathProgramCache]: Analyzing trace with hash -780162051, now seen corresponding path program 1 times [2018-11-18 14:57:50,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:57:50,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:57:50,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2007198715, now seen corresponding path program 1 times [2018-11-18 14:57:50,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:57:50,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:57:50,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:57:50,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:57:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:57:50,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 02:57:50 BoogieIcfgContainer [2018-11-18 14:57:50,929 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 14:57:50,930 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:57:50,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:57:50,930 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:57:50,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:57:50" (3/4) ... [2018-11-18 14:57:50,932 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 14:57:50,961 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_46793188-1035-4528-8f49-1558a93d7f55/bin-2019/uautomizer/witness.graphml [2018-11-18 14:57:50,961 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:57:50,962 INFO L168 Benchmark]: Toolchain (without parser) took 1126.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 958.2 MB in the beginning and 1.0 GB in the end (delta: -50.1 MB). Peak memory consumption was 81.0 MB. Max. memory is 11.5 GB. [2018-11-18 14:57:50,963 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:57:50,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.94 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:57:50,963 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.11 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:57:50,964 INFO L168 Benchmark]: Boogie Preprocessor took 48.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:57:50,964 INFO L168 Benchmark]: RCFGBuilder took 156.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:57:50,965 INFO L168 Benchmark]: BuchiAutomizer took 698.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.2 MB). Peak memory consumption was 103.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:57:50,965 INFO L168 Benchmark]: Witness Printer took 31.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:57:50,967 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.94 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.11 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 156.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 698.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.2 MB). Peak memory consumption was 103.2 MB. Max. memory is 11.5 GB. * Witness Printer took 31.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.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 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1154 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.6s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1154 states and ocurred in iteration 6. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 316 SDtfs, 160 SDslu, 183 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI6 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: 27]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6909cf0=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ba6996c=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d41b44e=0, lk5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f6fa6e5=1, lk6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23bbde10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64985b25=0, lk1=0, lk2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c47c576=0, cond=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 27]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L25] int cond; Loop: [L27] COND TRUE 1 [L28] cond = __VERIFIER_nondet_int() [L29] COND FALSE !(cond == 0) [L32] lk1 = 0 [L34] lk2 = 0 [L36] lk3 = 0 [L38] lk4 = 0 [L40] lk5 = 0 [L42] lk6 = 0 [L46] COND FALSE !(p1 != 0) [L50] COND FALSE !(p2 != 0) [L54] COND FALSE !(p3 != 0) [L58] COND FALSE !(p4 != 0) [L62] COND FALSE !(p5 != 0) [L66] COND FALSE !(p6 != 0) [L72] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L82] COND FALSE !(p3 != 0) [L87] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L97] COND FALSE !(p6 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...