./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/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 3381374679dc4a7458d725215e8a6e295cc6e6a1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:42:33,314 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:42:33,315 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:42:33,322 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:42:33,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:42:33,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:42:33,324 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:42:33,325 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:42:33,326 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:42:33,326 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:42:33,327 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:42:33,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:42:33,328 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:42:33,328 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:42:33,329 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:42:33,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:42:33,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:42:33,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:42:33,332 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:42:33,333 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:42:33,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:42:33,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:42:33,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:42:33,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:42:33,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:42:33,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:42:33,338 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:42:33,339 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:42:33,339 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:42:33,340 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:42:33,340 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:42:33,341 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:42:33,341 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:42:33,341 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:42:33,342 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:42:33,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:42:33,342 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 09:42:33,353 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:42:33,353 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:42:33,354 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:42:33,354 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:42:33,355 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 09:42:33,355 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 09:42:33,355 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 09:42:33,355 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 09:42:33,355 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 09:42:33,355 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 09:42:33,355 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 09:42:33,355 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:42:33,356 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:42:33,356 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 09:42:33,356 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:42:33,356 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:42:33,356 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:42:33,356 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 09:42:33,356 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 09:42:33,356 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 09:42:33,356 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:42:33,357 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:42:33,357 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 09:42:33,357 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 09:42:33,357 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:42:33,357 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:42:33,357 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 09:42:33,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:42:33,357 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 09:42:33,357 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 09:42:33,358 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 09:42:33,358 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_17b84785-aeae-49c9-bfcf-3cc6e937f6da/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 -> 3381374679dc4a7458d725215e8a6e295cc6e6a1 [2018-11-10 09:42:33,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:42:33,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:42:33,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:42:33,390 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:42:33,391 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:42:33,391 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 09:42:33,430 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/bin-2019/uautomizer/data/3ed833c18/9d1e3f7b89fb4ab6bd95ea640b2cbca8/FLAG189b254c2 [2018-11-10 09:42:33,860 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:42:33,860 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 09:42:33,869 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/bin-2019/uautomizer/data/3ed833c18/9d1e3f7b89fb4ab6bd95ea640b2cbca8/FLAG189b254c2 [2018-11-10 09:42:33,877 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/bin-2019/uautomizer/data/3ed833c18/9d1e3f7b89fb4ab6bd95ea640b2cbca8 [2018-11-10 09:42:33,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:42:33,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:42:33,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:42:33,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:42:33,884 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:42:33,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:42:33" (1/1) ... [2018-11-10 09:42:33,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23291eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:42:33, skipping insertion in model container [2018-11-10 09:42:33,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:42:33" (1/1) ... [2018-11-10 09:42:33,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:42:33,924 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:42:34,069 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:42:34,074 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:42:34,108 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:42:34,122 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:42:34,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:42:34 WrapperNode [2018-11-10 09:42:34,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:42:34,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:42:34,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:42:34,123 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:42:34,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:42:34" (1/1) ... [2018-11-10 09:42:34,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:42:34" (1/1) ... [2018-11-10 09:42:34,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:42:34,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:42:34,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:42:34,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:42:34,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:42:34" (1/1) ... [2018-11-10 09:42:34,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:42:34" (1/1) ... [2018-11-10 09:42:34,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:42:34" (1/1) ... [2018-11-10 09:42:34,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:42:34" (1/1) ... [2018-11-10 09:42:34,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:42:34" (1/1) ... [2018-11-10 09:42:34,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:42:34" (1/1) ... [2018-11-10 09:42:34,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:42:34" (1/1) ... [2018-11-10 09:42:34,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:42:34,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:42:34,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:42:34,215 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:42:34,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:42:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:42:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:42:34,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:42:34,686 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:42:34,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:42:34 BoogieIcfgContainer [2018-11-10 09:42:34,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:42:34,687 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 09:42:34,687 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 09:42:34,689 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 09:42:34,689 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:42:34,689 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 09:42:33" (1/3) ... [2018-11-10 09:42:34,690 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dbddb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:42:34, skipping insertion in model container [2018-11-10 09:42:34,690 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:42:34,690 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:42:34" (2/3) ... [2018-11-10 09:42:34,690 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dbddb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:42:34, skipping insertion in model container [2018-11-10 09:42:34,691 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:42:34,691 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:42:34" (3/3) ... [2018-11-10 09:42:34,692 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 09:42:34,724 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:42:34,724 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 09:42:34,724 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 09:42:34,724 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 09:42:34,724 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:42:34,724 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:42:34,725 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 09:42:34,725 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:42:34,725 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 09:42:34,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states. [2018-11-10 09:42:34,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2018-11-10 09:42:34,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:42:34,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:42:34,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:42:34,763 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] [2018-11-10 09:42:34,763 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 09:42:34,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states. [2018-11-10 09:42:34,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2018-11-10 09:42:34,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:42:34,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:42:34,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:42:34,770 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] [2018-11-10 09:42:34,775 INFO L793 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 9#L274true assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 117#L277-1true init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 50#L287true assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 40#L290-1true init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 89#L300true assume init_~r211~0 % 256 != 0;init_~tmp___1~0 := 1; 78#L303-1true init_~r212~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 106#L313true assume init_~r231~0 % 256 != 0;init_~tmp___2~0 := 1; 104#L316-1true init_~r232~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 29#L326true assume init_~r311~0 % 256 != 0;init_~tmp___3~0 := 1; 15#L329-1true init_~r312~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 53#L339true assume init_~r321~0 % 256 != 0;init_~tmp___4~0 := 1; 49#L342-1true init_~r322~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 94#L352true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 97#L352-1true init_#res := init_~tmp___5~0; 114#L437true main_#t~ret33 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 69#L545-3true [2018-11-10 09:42:34,775 INFO L795 eck$LassoCheckResult]: Loop: 69#L545-3true assume true; 85#L545-1true assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1; 17#L120true assume !(~mode1~0 % 256 != 0); 109#L145true assume !(~r1~0 < 2); 107#L145-1true ~mode1~0 := 1; 16#L120-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3; 56#L163true assume !(~mode2~0 % 256 != 0); 36#L188true assume !(~r2~0 < 2); 34#L188-1true ~mode2~0 := 1; 55#L163-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5; 105#L206true assume !(~mode3~0 % 256 != 0); 84#L231true assume !(~r3~0 < 2); 83#L231-1true ~mode3~0 := 1; 102#L206-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 120#L445true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 122#L445-1true check_#res := check_~tmp~1; 60#L493true main_#t~ret34 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 98#L575true assume !(assert_~arg % 256 == 0); 79#L570true assume { :end_inline_assert } true;main_#t~post35 := main_~i2~0;main_~i2~0 := main_#t~post35 + 1;havoc main_#t~post35; 69#L545-3true [2018-11-10 09:42:34,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:42:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2018347568, now seen corresponding path program 1 times [2018-11-10 09:42:34,782 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:42:34,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:42:34,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:34,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:42:34,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:42:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:42:34,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:42:34,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:42:34,944 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:42:34,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:42:34,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1910069824, now seen corresponding path program 1 times [2018-11-10 09:42:34,945 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:42:34,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:42:34,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:34,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:42:34,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:42:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:42:35,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:42:35,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:42:35,009 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:42:35,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:42:35,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:42:35,020 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 4 states. [2018-11-10 09:42:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:42:35,063 INFO L93 Difference]: Finished difference Result 125 states and 211 transitions. [2018-11-10 09:42:35,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:42:35,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 211 transitions. [2018-11-10 09:42:35,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-10 09:42:35,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 118 states and 184 transitions. [2018-11-10 09:42:35,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2018-11-10 09:42:35,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2018-11-10 09:42:35,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 184 transitions. [2018-11-10 09:42:35,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:42:35,075 INFO L705 BuchiCegarLoop]: Abstraction has 118 states and 184 transitions. [2018-11-10 09:42:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 184 transitions. [2018-11-10 09:42:35,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-10 09:42:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-10 09:42:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 184 transitions. [2018-11-10 09:42:35,104 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 184 transitions. [2018-11-10 09:42:35,104 INFO L608 BuchiCegarLoop]: Abstraction has 118 states and 184 transitions. [2018-11-10 09:42:35,104 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 09:42:35,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 184 transitions. [2018-11-10 09:42:35,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-10 09:42:35,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:42:35,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:42:35,108 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:42:35,108 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] [2018-11-10 09:42:35,109 INFO L793 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 276#L274 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 277#L277-1 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 342#L287 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 329#L290-1 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 330#L300 assume init_~r211~0 % 256 != 0;init_~tmp___1~0 := 1; 312#L303-1 init_~r212~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 370#L313 assume init_~r231~0 % 256 != 0;init_~tmp___2~0 := 1; 347#L316-1 init_~r232~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 310#L326 assume init_~r311~0 % 256 != 0;init_~tmp___3~0 := 1; 284#L329-1 init_~r312~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 286#L339 assume init_~r321~0 % 256 != 0;init_~tmp___4~0 := 1; 275#L342-1 init_~r322~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 341#L352 assume ~id1~0 != ~id2~0; 339#L353 assume ~id1~0 != ~id3~0; 272#L354 assume ~id2~0 != ~id3~0; 273#L355 assume ~id1~0 >= 0; 313#L356 assume ~id2~0 >= 0; 314#L357 assume ~id3~0 >= 0; 369#L358 assume ~r1~0 == 0; 308#L359 assume ~r2~0 == 0; 309#L360 assume ~r3~0 == 0; 345#L361 assume ~max1~0 == ~id1~0; 301#L362 assume ~max2~0 == ~id2~0; 302#L363 assume ~max3~0 == ~id3~0; 338#L364 assume ~st1~0 == 0; 270#L365 assume ~st2~0 == 0; 271#L366 assume ~st3~0 == 0; 335#L367 assume ~nl1~0 == 0; 336#L368 assume ~nl2~0 == 0; 368#L369 assume ~nl3~0 == 0; 306#L370 assume ~mode1~0 % 256 == 0; 307#L371 assume ~mode2~0 % 256 == 0; 343#L372 assume ~mode3~0 % 256 == 0;init_~tmp___5~0 := 1; 344#L352-1 init_#res := init_~tmp___5~0; 376#L437 main_#t~ret33 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 362#L545-3 [2018-11-10 09:42:35,109 INFO L795 eck$LassoCheckResult]: Loop: 362#L545-3 assume true; 363#L545-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1; 289#L120 assume !(~mode1~0 % 256 != 0); 290#L145 assume !(~r1~0 < 2); 280#L145-1 ~mode1~0 := 1; 287#L120-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3; 288#L163 assume !(~mode2~0 % 256 != 0); 320#L188 assume !(~r2~0 < 2); 315#L188-1 ~mode2~0 := 1; 316#L163-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5; 348#L206 assume !(~mode3~0 % 256 != 0); 373#L231 assume !(~r3~0 < 2); 319#L231-1 ~mode3~0 := 1; 372#L206-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 377#L445 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 327#L445-1 check_#res := check_~tmp~1; 352#L493 main_#t~ret34 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 353#L575 assume !(assert_~arg % 256 == 0); 371#L570 assume { :end_inline_assert } true;main_#t~post35 := main_~i2~0;main_~i2~0 := main_#t~post35 + 1;havoc main_#t~post35; 362#L545-3 [2018-11-10 09:42:35,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:42:35,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1347795084, now seen corresponding path program 1 times [2018-11-10 09:42:35,109 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:42:35,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:42:35,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:35,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:42:35,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:42:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:42:35,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:42:35,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1910069824, now seen corresponding path program 2 times [2018-11-10 09:42:35,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:42:35,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:42:35,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:35,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:42:35,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:42:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:42:35,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:42:35,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:42:35,227 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:42:35,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:42:35,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:42:35,227 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. cyclomatic complexity: 67 Second operand 5 states. [2018-11-10 09:42:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:42:35,279 INFO L93 Difference]: Finished difference Result 121 states and 186 transitions. [2018-11-10 09:42:35,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:42:35,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 186 transitions. [2018-11-10 09:42:35,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-10 09:42:35,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 118 states and 176 transitions. [2018-11-10 09:42:35,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2018-11-10 09:42:35,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2018-11-10 09:42:35,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 176 transitions. [2018-11-10 09:42:35,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:42:35,284 INFO L705 BuchiCegarLoop]: Abstraction has 118 states and 176 transitions. [2018-11-10 09:42:35,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 176 transitions. [2018-11-10 09:42:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-10 09:42:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-10 09:42:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 176 transitions. [2018-11-10 09:42:35,287 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 176 transitions. [2018-11-10 09:42:35,287 INFO L608 BuchiCegarLoop]: Abstraction has 118 states and 176 transitions. [2018-11-10 09:42:35,287 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 09:42:35,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 176 transitions. [2018-11-10 09:42:35,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-10 09:42:35,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:42:35,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:42:35,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:42:35,289 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-10 09:42:35,290 INFO L793 eck$LassoCheckResult]: Stem: 625#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 532#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 527#L274 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 528#L277-1 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 592#L287 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 579#L290-1 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 580#L300 assume init_~r211~0 % 256 != 0;init_~tmp___1~0 := 1; 563#L303-1 init_~r212~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 621#L313 assume init_~r231~0 % 256 != 0;init_~tmp___2~0 := 1; 597#L316-1 init_~r232~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 561#L326 assume init_~r311~0 % 256 != 0;init_~tmp___3~0 := 1; 535#L329-1 init_~r312~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 537#L339 assume init_~r321~0 % 256 != 0;init_~tmp___4~0 := 1; 526#L342-1 init_~r322~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 591#L352 assume ~id1~0 != ~id2~0; 589#L353 assume ~id1~0 != ~id3~0; 523#L354 assume ~id2~0 != ~id3~0; 524#L355 assume ~id1~0 >= 0; 564#L356 assume ~id2~0 >= 0; 565#L357 assume ~id3~0 >= 0; 620#L358 assume ~r1~0 == 0; 559#L359 assume ~r2~0 == 0; 560#L360 assume ~r3~0 == 0; 595#L361 assume ~max1~0 == ~id1~0; 552#L362 assume ~max2~0 == ~id2~0; 553#L363 assume ~max3~0 == ~id3~0; 588#L364 assume ~st1~0 == 0; 521#L365 assume ~st2~0 == 0; 522#L366 assume ~st3~0 == 0; 585#L367 assume ~nl1~0 == 0; 586#L368 assume ~nl2~0 == 0; 619#L369 assume ~nl3~0 == 0; 557#L370 assume ~mode1~0 % 256 == 0; 558#L371 assume ~mode2~0 % 256 == 0; 593#L372 assume ~mode3~0 % 256 == 0;init_~tmp___5~0 := 1; 594#L352-1 init_#res := init_~tmp___5~0; 627#L437 main_#t~ret33 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 613#L545-3 [2018-11-10 09:42:35,290 INFO L795 eck$LassoCheckResult]: Loop: 613#L545-3 assume true; 614#L545-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1; 540#L120 assume !(~mode1~0 % 256 != 0); 541#L145 assume !(~r1~0 < 2); 531#L145-1 ~mode1~0 := 1; 538#L120-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3; 539#L163 assume !(~mode2~0 % 256 != 0); 571#L188 assume !(~r2~0 < 2); 566#L188-1 ~mode2~0 := 1; 567#L163-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5; 598#L206 assume !(~mode3~0 % 256 != 0); 624#L231 assume !(~r3~0 < 2); 570#L231-1 ~mode3~0 := 1; 623#L206-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 628#L445 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 615#L446 assume ~st1~0 + ~nl1~0 <= 1; 577#L447 assume ~st2~0 + ~nl2~0 <= 1; 578#L448 assume ~st3~0 + ~nl3~0 <= 1; 608#L449 assume ~r1~0 >= 2; 543#L453 assume ~r1~0 < 2; 544#L458 assume ~r1~0 >= 2; 575#L463 assume ~r1~0 < 2;check_~tmp~1 := 1; 600#L445-1 check_#res := check_~tmp~1; 603#L493 main_#t~ret34 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 604#L575 assume !(assert_~arg % 256 == 0); 622#L570 assume { :end_inline_assert } true;main_#t~post35 := main_~i2~0;main_~i2~0 := main_#t~post35 + 1;havoc main_#t~post35; 613#L545-3 [2018-11-10 09:42:35,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:42:35,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1347795084, now seen corresponding path program 2 times [2018-11-10 09:42:35,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:42:35,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:42:35,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:35,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:42:35,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:42:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:42:35,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:42:35,330 INFO L82 PathProgramCache]: Analyzing trace with hash -249325079, now seen corresponding path program 1 times [2018-11-10 09:42:35,330 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:42:35,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:42:35,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:35,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:42:35,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:42:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:42:35,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:42:35,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:42:35,355 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:42:35,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:42:35,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:42:35,356 INFO L87 Difference]: Start difference. First operand 118 states and 176 transitions. cyclomatic complexity: 59 Second operand 3 states. [2018-11-10 09:42:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:42:35,402 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2018-11-10 09:42:35,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:42:35,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 254 transitions. [2018-11-10 09:42:35,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2018-11-10 09:42:35,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 171 states and 254 transitions. [2018-11-10 09:42:35,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 171 [2018-11-10 09:42:35,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 171 [2018-11-10 09:42:35,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 254 transitions. [2018-11-10 09:42:35,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:42:35,406 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 254 transitions. [2018-11-10 09:42:35,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 254 transitions. [2018-11-10 09:42:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-11-10 09:42:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-10 09:42:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 254 transitions. [2018-11-10 09:42:35,410 INFO L728 BuchiCegarLoop]: Abstraction has 171 states and 254 transitions. [2018-11-10 09:42:35,410 INFO L608 BuchiCegarLoop]: Abstraction has 171 states and 254 transitions. [2018-11-10 09:42:35,410 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 09:42:35,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 254 transitions. [2018-11-10 09:42:35,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2018-11-10 09:42:35,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:42:35,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:42:35,412 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:42:35,412 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:42:35,412 INFO L793 eck$LassoCheckResult]: Stem: 920#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 827#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 822#L274 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 823#L277-1 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 887#L287 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 873#L290-1 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 874#L300 assume init_~r211~0 % 256 != 0;init_~tmp___1~0 := 1; 857#L303-1 init_~r212~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 915#L313 assume init_~r231~0 % 256 != 0;init_~tmp___2~0 := 1; 892#L316-1 init_~r232~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 855#L326 assume init_~r311~0 % 256 != 0;init_~tmp___3~0 := 1; 830#L329-1 init_~r312~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 832#L339 assume init_~r321~0 % 256 != 0;init_~tmp___4~0 := 1; 821#L342-1 init_~r322~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 886#L352 assume ~id1~0 != ~id2~0; 884#L353 assume ~id1~0 != ~id3~0; 818#L354 assume ~id2~0 != ~id3~0; 819#L355 assume ~id1~0 >= 0; 858#L356 assume ~id2~0 >= 0; 859#L357 assume ~id3~0 >= 0; 914#L358 assume ~r1~0 == 0; 853#L359 assume ~r2~0 == 0; 854#L360 assume ~r3~0 == 0; 890#L361 assume ~max1~0 == ~id1~0; 846#L362 assume ~max2~0 == ~id2~0; 847#L363 assume ~max3~0 == ~id3~0; 883#L364 assume ~st1~0 == 0; 816#L365 assume ~st2~0 == 0; 817#L366 assume ~st3~0 == 0; 879#L367 assume ~nl1~0 == 0; 880#L368 assume ~nl2~0 == 0; 913#L369 assume ~nl3~0 == 0; 851#L370 assume ~mode1~0 % 256 == 0; 852#L371 assume ~mode2~0 % 256 == 0; 888#L372 assume ~mode3~0 % 256 == 0;init_~tmp___5~0 := 1; 889#L352-1 init_#res := init_~tmp___5~0; 926#L437 main_#t~ret33 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 934#L545-3 [2018-11-10 09:42:35,413 INFO L795 eck$LassoCheckResult]: Loop: 934#L545-3 assume true; 972#L545-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1; 971#L120 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256); 837#L122 assume !(~ep21~0 % 256 != 0); 843#L122-1 assume !(~ep31~0 % 256 != 0); 877#L129 assume !(~r1~0 == 2); 844#L136 ~mode1~0 := 0; 833#L120-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3; 834#L163 assume !(~mode2~0 % 256 != 0); 865#L188 assume !(~r2~0 < 2); 860#L188-1 ~mode2~0 := 1; 861#L163-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5; 893#L206 assume !(~mode3~0 % 256 != 0); 919#L231 assume !(~r3~0 < 2); 864#L231-1 ~mode3~0 := 1; 918#L206-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 941#L445 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 940#L446 assume ~st1~0 + ~nl1~0 <= 1; 939#L447 assume ~st2~0 + ~nl2~0 <= 1; 938#L448 assume ~st3~0 + ~nl3~0 <= 1; 937#L449 assume !(~r1~0 >= 2); 881#L452 assume ~st1~0 + ~st2~0 + ~st3~0 == 0; 882#L453 assume ~r1~0 < 2; 944#L458 assume !(~r1~0 >= 2); 922#L462 assume ~nl1~0 + ~nl2~0 + ~nl3~0 == 0; 923#L463 assume ~r1~0 < 2;check_~tmp~1 := 1; 976#L445-1 check_#res := check_~tmp~1; 975#L493 main_#t~ret34 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 974#L575 assume !(assert_~arg % 256 == 0); 973#L570 assume { :end_inline_assert } true;main_#t~post35 := main_~i2~0;main_~i2~0 := main_#t~post35 + 1;havoc main_#t~post35; 934#L545-3 [2018-11-10 09:42:35,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:42:35,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1347795084, now seen corresponding path program 3 times [2018-11-10 09:42:35,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:42:35,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:42:35,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:35,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:42:35,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:42:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:42:35,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:42:35,451 INFO L82 PathProgramCache]: Analyzing trace with hash 750454756, now seen corresponding path program 1 times [2018-11-10 09:42:35,451 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:42:35,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:42:35,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:35,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:42:35,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:42:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:42:35,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:42:35,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1962867689, now seen corresponding path program 1 times [2018-11-10 09:42:35,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:42:35,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:42:35,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:35,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:42:35,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:42:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:42:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:42:35,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:42:35,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:42:35,713 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 110 [2018-11-10 09:42:35,805 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:42:35,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:42:35,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:42:35,806 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:42:35,806 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:42:35,806 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:42:35,806 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:42:35,806 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:42:35,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-10 09:42:35,807 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:42:35,807 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:42:35,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:35,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,246 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:42:36,247 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:42:36,251 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:42:36,251 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17b84785-aeae-49c9-bfcf-3cc6e937f6da/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:42:36,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:42:36,283 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:42:36,386 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:42:36,387 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:42:36,387 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:42:36,388 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:42:36,388 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:42:36,388 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:42:36,388 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:42:36,388 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:42:36,388 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:42:36,388 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-10 09:42:36,388 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:42:36,388 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:42:36,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:42:36,794 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:42:36,798 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:42:36,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:42:36,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:42:36,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:42:36,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:42:36,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:42:36,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:42:36,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:42:36,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:42:36,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:42:36,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:42:36,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:42:36,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:42:36,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:42:36,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:42:36,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:42:36,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:42:36,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:42:36,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:42:36,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:42:36,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:42:36,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:42:36,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:42:36,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:42:36,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:42:36,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:42:36,811 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:42:36,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:42:36,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:42:36,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:42:36,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:42:36,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:42:36,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:42:36,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:42:36,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:42:36,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:42:36,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:42:36,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:42:36,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:42:36,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:42:36,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:42:36,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:42:36,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:42:36,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:42:36,814 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:42:36,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:42:36,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:42:36,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:42:36,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:42:36,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:42:36,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:42:36,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:42:36,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:42:36,816 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:42:36,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:42:36,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:42:36,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:42:36,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:42:36,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:42:36,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:42:36,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:42:36,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:42:36,817 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:42:36,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:42:36,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:42:36,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:42:36,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:42:36,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:42:36,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:42:36,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:42:36,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:42:36,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:42:36,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:42:36,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:42:36,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:42:36,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:42:36,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:42:36,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:42:36,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:42:36,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:42:36,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:42:36,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:42:36,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:42:36,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:42:36,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:42:36,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:42:36,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:42:36,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:42:36,829 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:42:36,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:42:36,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:42:36,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:42:36,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:42:36,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:42:36,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:42:36,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:42:36,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:42:36,832 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:42:36,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:42:36,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:42:36,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:42:36,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:42:36,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:42:36,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:42:36,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:42:36,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:42:36,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:42:36,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:42:36,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:42:36,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:42:36,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:42:36,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:42:36,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:42:36,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:42:36,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:42:36,837 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:42:36,839 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:42:36,840 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:42:36,841 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:42:36,841 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:42:36,842 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:42:36,842 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2018-11-10 09:42:36,843 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:42:36,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:42:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:42:36,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:42:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:42:36,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:42:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:42:36,964 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 09:42:36,965 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 254 transitions. cyclomatic complexity: 84 Second operand 4 states. [2018-11-10 09:42:37,007 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 254 transitions. cyclomatic complexity: 84. Second operand 4 states. Result 292 states and 441 transitions. Complement of second has 6 states. [2018-11-10 09:42:37,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:42:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:42:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2018-11-10 09:42:37,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 37 letters. Loop has 30 letters. [2018-11-10 09:42:37,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:42:37,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 67 letters. Loop has 30 letters. [2018-11-10 09:42:37,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:42:37,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 37 letters. Loop has 60 letters. [2018-11-10 09:42:37,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:42:37,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 441 transitions. [2018-11-10 09:42:37,015 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:42:37,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 0 states and 0 transitions. [2018-11-10 09:42:37,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 09:42:37,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 09:42:37,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 09:42:37,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:42:37,016 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:42:37,016 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:42:37,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:42:37,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:42:37,016 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 09:42:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:42:37,016 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 09:42:37,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 09:42:37,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 09:42:37,017 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:42:37,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 09:42:37,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 09:42:37,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 09:42:37,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 09:42:37,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:42:37,017 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:42:37,017 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:42:37,021 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:42:37,022 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 09:42:37,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:42:37,022 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:42:37,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 09:42:37,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 09:42:37 BoogieIcfgContainer [2018-11-10 09:42:37,026 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 09:42:37,026 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:42:37,026 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:42:37,026 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:42:37,027 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:42:34" (3/4) ... [2018-11-10 09:42:37,029 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 09:42:37,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:42:37,030 INFO L168 Benchmark]: Toolchain (without parser) took 3150.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 960.9 MB in the beginning and 865.4 MB in the end (delta: 95.5 MB). Peak memory consumption was 229.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:42:37,030 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:42:37,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.06 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 939.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:42:37,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:42:37,032 INFO L168 Benchmark]: Boogie Preprocessor took 21.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:42:37,032 INFO L168 Benchmark]: RCFGBuilder took 471.06 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: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2018-11-10 09:42:37,033 INFO L168 Benchmark]: BuchiAutomizer took 2339.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 865.4 MB in the end (delta: 215.7 MB). Peak memory consumption was 215.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:42:37,033 INFO L168 Benchmark]: Witness Printer took 3.11 ms. Allocated memory is still 1.2 GB. Free memory is still 865.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:42:37,036 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 242.06 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 939.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 471.06 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: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2339.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 865.4 MB in the end (delta: 215.7 MB). Peak memory consumption was 215.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.11 ms. Allocated memory is still 1.2 GB. Free memory is still 865.4 MB. There was no memory consumed. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 171 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 741 SDtfs, 242 SDslu, 1191 SDs, 0 SdLazy, 39 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital162 mio100 ax122 hnf104 lsp18 ukn100 mio100 lsp100 div157 bol100 ite113 ukn100 eq144 hnf75 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...