./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_true-unreach-call.ufo.BOUNDED-12.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_b461334a-10b8-49ea-9e3d-b0145d38f195/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b461334a-10b8-49ea-9e3d-b0145d38f195/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b461334a-10b8-49ea-9e3d-b0145d38f195/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b461334a-10b8-49ea-9e3d-b0145d38f195/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b461334a-10b8-49ea-9e3d-b0145d38f195/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b461334a-10b8-49ea-9e3d-b0145d38f195/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 7d8e1a2dd98c6448f68de9ca5556d84e0578394c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:11:55,851 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:55,853 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:55,866 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:55,866 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:55,867 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:55,868 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:55,870 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:55,871 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:55,872 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:55,873 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:55,873 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:55,874 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:55,875 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:55,876 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:55,877 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:55,877 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:55,879 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:55,880 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:55,881 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:55,882 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:55,884 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:55,885 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:55,885 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:55,886 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:55,886 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:55,888 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:55,888 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:55,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:55,890 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:55,890 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:55,891 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:55,891 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:55,892 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:55,892 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:55,893 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:55,893 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b461334a-10b8-49ea-9e3d-b0145d38f195/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:11:55,906 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:55,906 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:55,907 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:11:55,907 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:11:55,908 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:11:55,908 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:11:55,908 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:11:55,908 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:11:55,908 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:11:55,908 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:11:55,908 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:11:55,909 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:55,909 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:11:55,909 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:11:55,909 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:55,909 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:11:55,909 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:55,909 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:11:55,910 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:11:55,910 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:11:55,910 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:11:55,910 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:55,910 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:11:55,910 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:11:55,911 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:55,911 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:55,911 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:11:55,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:55,914 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:11:55,914 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:11:55,915 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:11:55,915 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_b461334a-10b8-49ea-9e3d-b0145d38f195/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 -> 7d8e1a2dd98c6448f68de9ca5556d84e0578394c [2018-10-27 06:11:55,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:11:55,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:11:55,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:11:55,966 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:11:55,966 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:11:55,967 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b461334a-10b8-49ea-9e3d-b0145d38f195/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2018-10-27 06:11:56,018 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b461334a-10b8-49ea-9e3d-b0145d38f195/bin-2019/uautomizer/data/f31e9762a/f8da88ee13a540e6844452579f82cfd6/FLAG81969fbd3 [2018-10-27 06:11:56,448 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:11:56,449 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b461334a-10b8-49ea-9e3d-b0145d38f195/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2018-10-27 06:11:56,460 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b461334a-10b8-49ea-9e3d-b0145d38f195/bin-2019/uautomizer/data/f31e9762a/f8da88ee13a540e6844452579f82cfd6/FLAG81969fbd3 [2018-10-27 06:11:56,475 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b461334a-10b8-49ea-9e3d-b0145d38f195/bin-2019/uautomizer/data/f31e9762a/f8da88ee13a540e6844452579f82cfd6 [2018-10-27 06:11:56,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:11:56,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:11:56,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:56,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:11:56,484 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:11:56,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:56" (1/1) ... [2018-10-27 06:11:56,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d595fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:56, skipping insertion in model container [2018-10-27 06:11:56,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:56" (1/1) ... [2018-10-27 06:11:56,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:11:56,535 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:11:56,732 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:56,740 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:11:56,823 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:56,840 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:11:56,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:56 WrapperNode [2018-10-27 06:11:56,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:56,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:56,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:11:56,841 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:11:56,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:56" (1/1) ... [2018-10-27 06:11:56,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:56" (1/1) ... [2018-10-27 06:11:56,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:57,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:11:57,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:11:57,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:11:57,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:56" (1/1) ... [2018-10-27 06:11:57,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:56" (1/1) ... [2018-10-27 06:11:57,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:56" (1/1) ... [2018-10-27 06:11:57,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:56" (1/1) ... [2018-10-27 06:11:57,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:56" (1/1) ... [2018-10-27 06:11:57,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:56" (1/1) ... [2018-10-27 06:11:57,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:56" (1/1) ... [2018-10-27 06:11:57,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:11:57,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:11:57,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:11:57,066 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:11:57,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b461334a-10b8-49ea-9e3d-b0145d38f195/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-10-27 06:11:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:11:57,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:11:58,110 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:11:58,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:58 BoogieIcfgContainer [2018-10-27 06:11:58,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:11:58,111 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:11:58,111 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:11:58,114 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:11:58,114 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:58,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:11:56" (1/3) ... [2018-10-27 06:11:58,116 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24b4785b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:58, skipping insertion in model container [2018-10-27 06:11:58,117 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:58,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:56" (2/3) ... [2018-10-27 06:11:58,117 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24b4785b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:58, skipping insertion in model container [2018-10-27 06:11:58,117 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:58,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:58" (3/3) ... [2018-10-27 06:11:58,119 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2018-10-27 06:11:58,163 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:11:58,164 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:11:58,164 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:11:58,165 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:11:58,165 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:11:58,167 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:11:58,167 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:11:58,167 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:11:58,168 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:11:58,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states. [2018-10-27 06:11:58,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2018-10-27 06:11:58,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:58,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:58,218 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:58,218 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, 1] [2018-10-27 06:11:58,218 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:11:58,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states. [2018-10-27 06:11:58,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2018-10-27 06:11:58,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:58,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:58,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:58,226 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, 1] [2018-10-27 06:11:58,233 INFO L793 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 8#L332true assume !(~r1~0 == 0);init_~tmp~0 := 0; 10#L332-1true init_#res := init_~tmp~0; 16#L497true main_#t~ret43 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 74#L573-3true [2018-10-27 06:11:58,234 INFO L795 eck$LassoCheckResult]: Loop: 74#L573-3true assume true; 70#L573-1true assume !!(main_~i2~0 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 116#L126true assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 71#L130true assume !(node1_~m1~0 != ~nomsg~0); 69#L130-1true ~mode1~0 := 0; 110#L126-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 32#L161true assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 19#L164true assume !(node2_~m2~0 != ~nomsg~0); 18#L164-1true ~mode2~0 := 0; 30#L161-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 126#L195true assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 98#L198true assume !(node3_~m3~0 != ~nomsg~0); 93#L198-1true ~mode3~0 := 0; 123#L195-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 57#L229true assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 49#L232true assume !(node4_~m4~0 != ~nomsg~0); 48#L232-1true ~mode4~0 := 0; 73#L229-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 9#L263true assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 13#L266true assume !(node5_~m5~0 != ~nomsg~0); 135#L266-1true ~mode5~0 := 0; 3#L263-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 100#L297true assume ~mode6~0 % 256 != 0;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 106#L300true assume !(node6_~m6~0 != ~nomsg~0); 104#L300-1true ~mode6~0 := 0; 99#L297-2true assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 22#L505true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 23#L505-1true check_#res := check_~tmp~1; 127#L517true main_#t~ret44 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;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; 66#L606true assume !(assert_~arg % 256 == 0); 43#L601true assume { :end_inline_assert } true;main_#t~post45 := main_~i2~0;main_~i2~0 := main_#t~post45 + 1;havoc main_#t~post45; 74#L573-3true [2018-10-27 06:11:58,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:58,244 INFO L82 PathProgramCache]: Analyzing trace with hash 28934070, now seen corresponding path program 1 times [2018-10-27 06:11:58,245 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:58,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:58,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:58,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:58,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:58,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:58,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:11:58,433 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:58,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:58,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1608705424, now seen corresponding path program 1 times [2018-10-27 06:11:58,434 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:58,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:58,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:58,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:58,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:58,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:58,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:11:58,615 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:58,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:11:58,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:11:58,629 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2018-10-27 06:11:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:58,923 INFO L93 Difference]: Finished difference Result 145 states and 242 transitions. [2018-10-27 06:11:58,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:11:58,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 242 transitions. [2018-10-27 06:11:58,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-10-27 06:11:58,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 138 states and 195 transitions. [2018-10-27 06:11:58,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-10-27 06:11:58,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2018-10-27 06:11:58,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 195 transitions. [2018-10-27 06:11:58,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:58,948 INFO L705 BuchiCegarLoop]: Abstraction has 138 states and 195 transitions. [2018-10-27 06:11:58,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 195 transitions. [2018-10-27 06:11:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-10-27 06:11:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-27 06:11:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 195 transitions. [2018-10-27 06:11:58,985 INFO L728 BuchiCegarLoop]: Abstraction has 138 states and 195 transitions. [2018-10-27 06:11:58,986 INFO L608 BuchiCegarLoop]: Abstraction has 138 states and 195 transitions. [2018-10-27 06:11:58,986 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:11:58,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 195 transitions. [2018-10-27 06:11:58,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-10-27 06:11:58,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:58,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:58,990 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:58,990 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, 1] [2018-10-27 06:11:58,990 INFO L793 eck$LassoCheckResult]: Stem: 431#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 318#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 314#L332 assume ~r1~0 == 0; 315#L333 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 374#L334 assume ~id1~0 >= 0; 375#L335 assume ~st1~0 == 0; 425#L336 assume ~send1~0 == ~id1~0; 363#L337 assume ~mode1~0 % 256 == 0; 364#L338 assume ~id2~0 >= 0; 407#L339 assume ~st2~0 == 0; 319#L340 assume ~send2~0 == ~id2~0; 320#L341 assume ~mode2~0 % 256 == 0; 400#L342 assume ~id3~0 >= 0; 309#L343 assume ~st3~0 == 0; 310#L344 assume ~send3~0 == ~id3~0; 372#L345 assume ~mode3~0 % 256 == 0; 373#L346 assume ~id4~0 >= 0; 424#L347 assume ~st4~0 == 0; 361#L348 assume ~send4~0 == ~id4~0; 362#L349 assume ~mode4~0 % 256 == 0; 406#L350 assume ~id5~0 >= 0; 349#L351 assume ~st5~0 == 0; 350#L352 assume ~send5~0 == ~id5~0; 399#L353 assume ~mode5~0 % 256 == 0; 307#L354 assume ~id6~0 >= 0; 308#L355 assume ~st6~0 == 0; 369#L356 assume ~send6~0 == ~id6~0; 370#L357 assume ~mode6~0 % 256 == 0; 423#L358 assume ~id1~0 != ~id2~0; 357#L359 assume ~id1~0 != ~id3~0; 358#L360 assume ~id1~0 != ~id4~0; 404#L361 assume ~id1~0 != ~id5~0; 346#L362 assume ~id1~0 != ~id6~0; 347#L363 assume ~id2~0 != ~id3~0; 398#L364 assume ~id2~0 != ~id4~0; 305#L365 assume ~id2~0 != ~id5~0; 306#L366 assume ~id2~0 != ~id6~0; 392#L367 assume ~id3~0 != ~id4~0; 393#L368 assume ~id3~0 != ~id5~0; 421#L369 assume ~id3~0 != ~id6~0; 353#L370 assume ~id4~0 != ~id5~0; 354#L371 assume ~id4~0 != ~id6~0; 403#L372 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 316#L332-1 init_#res := init_~tmp~0; 317#L497 main_#t~ret43 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 326#L573-3 [2018-10-27 06:11:58,990 INFO L795 eck$LassoCheckResult]: Loop: 326#L573-3 assume true; 409#L573-1 assume !!(main_~i2~0 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 410#L126 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 411#L130 assume !(node1_~m1~0 != ~nomsg~0); 328#L130-1 ~mode1~0 := 0; 341#L126-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 355#L161 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 332#L164 assume !(node2_~m2~0 != ~nomsg~0); 330#L164-1 ~mode2~0 := 0; 331#L161-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 351#L195 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 428#L198 assume !(node3_~m3~0 != ~nomsg~0); 382#L198-1 ~mode3~0 := 0; 418#L195-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 396#L229 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 383#L232 assume !(node4_~m4~0 != ~nomsg~0); 379#L232-1 ~mode4~0 := 0; 360#L229-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 311#L263 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 312#L266 assume !(node5_~m5~0 != ~nomsg~0); 322#L266-1 ~mode5~0 := 0; 303#L263-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 304#L297 assume ~mode6~0 % 256 != 0;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 429#L300 assume !(node6_~m6~0 != ~nomsg~0); 391#L300-1 ~mode6~0 := 0; 412#L297-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 336#L505 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 337#L505-1 check_#res := check_~tmp~1; 339#L517 main_#t~ret44 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;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; 405#L606 assume !(assert_~arg % 256 == 0); 371#L601 assume { :end_inline_assert } true;main_#t~post45 := main_~i2~0;main_~i2~0 := main_#t~post45 + 1;havoc main_#t~post45; 326#L573-3 [2018-10-27 06:11:58,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:58,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 1 times [2018-10-27 06:11:58,991 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:58,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:58,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:58,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:58,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:59,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:59,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1608705424, now seen corresponding path program 2 times [2018-10-27 06:11:59,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:59,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:59,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:59,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:59,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:59,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:59,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:11:59,255 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:59,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:11:59,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:59,255 INFO L87 Difference]: Start difference. First operand 138 states and 195 transitions. cyclomatic complexity: 58 Second operand 5 states. [2018-10-27 06:11:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:59,360 INFO L93 Difference]: Finished difference Result 141 states and 197 transitions. [2018-10-27 06:11:59,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:11:59,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 197 transitions. [2018-10-27 06:11:59,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-10-27 06:11:59,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 138 states and 193 transitions. [2018-10-27 06:11:59,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-10-27 06:11:59,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2018-10-27 06:11:59,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 193 transitions. [2018-10-27 06:11:59,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:59,366 INFO L705 BuchiCegarLoop]: Abstraction has 138 states and 193 transitions. [2018-10-27 06:11:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 193 transitions. [2018-10-27 06:11:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-10-27 06:11:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-27 06:11:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 193 transitions. [2018-10-27 06:11:59,374 INFO L728 BuchiCegarLoop]: Abstraction has 138 states and 193 transitions. [2018-10-27 06:11:59,374 INFO L608 BuchiCegarLoop]: Abstraction has 138 states and 193 transitions. [2018-10-27 06:11:59,374 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:11:59,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 193 transitions. [2018-10-27 06:11:59,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-10-27 06:11:59,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:59,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:59,377 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:59,377 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, 1, 1] [2018-10-27 06:11:59,379 INFO L793 eck$LassoCheckResult]: Stem: 722#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 609#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 605#L332 assume ~r1~0 == 0; 606#L333 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 665#L334 assume ~id1~0 >= 0; 666#L335 assume ~st1~0 == 0; 716#L336 assume ~send1~0 == ~id1~0; 654#L337 assume ~mode1~0 % 256 == 0; 655#L338 assume ~id2~0 >= 0; 698#L339 assume ~st2~0 == 0; 610#L340 assume ~send2~0 == ~id2~0; 611#L341 assume ~mode2~0 % 256 == 0; 691#L342 assume ~id3~0 >= 0; 600#L343 assume ~st3~0 == 0; 601#L344 assume ~send3~0 == ~id3~0; 663#L345 assume ~mode3~0 % 256 == 0; 664#L346 assume ~id4~0 >= 0; 715#L347 assume ~st4~0 == 0; 652#L348 assume ~send4~0 == ~id4~0; 653#L349 assume ~mode4~0 % 256 == 0; 697#L350 assume ~id5~0 >= 0; 640#L351 assume ~st5~0 == 0; 641#L352 assume ~send5~0 == ~id5~0; 690#L353 assume ~mode5~0 % 256 == 0; 598#L354 assume ~id6~0 >= 0; 599#L355 assume ~st6~0 == 0; 660#L356 assume ~send6~0 == ~id6~0; 661#L357 assume ~mode6~0 % 256 == 0; 714#L358 assume ~id1~0 != ~id2~0; 648#L359 assume ~id1~0 != ~id3~0; 649#L360 assume ~id1~0 != ~id4~0; 695#L361 assume ~id1~0 != ~id5~0; 638#L362 assume ~id1~0 != ~id6~0; 639#L363 assume ~id2~0 != ~id3~0; 689#L364 assume ~id2~0 != ~id4~0; 596#L365 assume ~id2~0 != ~id5~0; 597#L366 assume ~id2~0 != ~id6~0; 683#L367 assume ~id3~0 != ~id4~0; 684#L368 assume ~id3~0 != ~id5~0; 712#L369 assume ~id3~0 != ~id6~0; 644#L370 assume ~id4~0 != ~id5~0; 645#L371 assume ~id4~0 != ~id6~0; 694#L372 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 607#L332-1 init_#res := init_~tmp~0; 608#L497 main_#t~ret43 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 617#L573-3 [2018-10-27 06:11:59,379 INFO L795 eck$LassoCheckResult]: Loop: 617#L573-3 assume true; 700#L573-1 assume !!(main_~i2~0 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 701#L126 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 702#L130 assume !(node1_~m1~0 != ~nomsg~0); 621#L130-1 ~mode1~0 := 0; 632#L126-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 646#L161 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 623#L164 assume !(node2_~m2~0 != ~nomsg~0); 618#L164-1 ~mode2~0 := 0; 619#L161-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 642#L195 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 719#L198 assume !(node3_~m3~0 != ~nomsg~0); 672#L198-1 ~mode3~0 := 0; 709#L195-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 687#L229 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 674#L232 assume !(node4_~m4~0 != ~nomsg~0); 673#L232-1 ~mode4~0 := 0; 651#L229-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 602#L263 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 603#L266 assume !(node5_~m5~0 != ~nomsg~0); 613#L266-1 ~mode5~0 := 0; 594#L263-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 595#L297 assume ~mode6~0 % 256 != 0;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 720#L300 assume !(node6_~m6~0 != ~nomsg~0); 682#L300-1 ~mode6~0 := 0; 703#L297-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 627#L505 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 628#L506 assume ~r1~0 < 6;check_~tmp~1 := 1; 629#L505-1 check_#res := check_~tmp~1; 630#L517 main_#t~ret44 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;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; 696#L606 assume !(assert_~arg % 256 == 0); 662#L601 assume { :end_inline_assert } true;main_#t~post45 := main_~i2~0;main_~i2~0 := main_#t~post45 + 1;havoc main_#t~post45; 617#L573-3 [2018-10-27 06:11:59,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:59,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 2 times [2018-10-27 06:11:59,379 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:59,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:59,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:59,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:59,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:59,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:59,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2053066356, now seen corresponding path program 1 times [2018-10-27 06:11:59,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:59,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:59,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:59,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:59,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:59,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2020473867, now seen corresponding path program 1 times [2018-10-27 06:11:59,500 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:59,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:59,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:59,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:59,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:59,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:59,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:59,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:00,576 WARN L179 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 157 [2018-10-27 06:12:01,385 WARN L179 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 134 [2018-10-27 06:12:01,397 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:01,398 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:01,398 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:01,399 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:01,399 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:12:01,399 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:01,400 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:01,400 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:01,400 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c_Iteration3_Loop [2018-10-27 06:12:01,400 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:01,400 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:01,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,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-10-27 06:12:01,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:01,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,263 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:02,264 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b461334a-10b8-49ea-9e3d-b0145d38f195/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-10-27 06:12:02,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:12:02,269 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b461334a-10b8-49ea-9e3d-b0145d38f195/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-10-27 06:12:02,292 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:12:02,292 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:12:02,434 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:12:02,435 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:02,435 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:02,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:02,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:02,435 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:02,436 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:02,436 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:02,436 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:02,436 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c_Iteration3_Loop [2018-10-27 06:12:02,436 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:02,436 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:02,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-10-27 06:12:02,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,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-10-27 06:12:02,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:02,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:03,144 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-10-27 06:12:03,405 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:03,409 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:03,411 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-10-27 06:12:03,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:03,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:03,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:03,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:03,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:03,422 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-10-27 06:12:03,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:03,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:03,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:03,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:03,429 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-10-27 06:12:03,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:03,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:03,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:03,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:03,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:03,435 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-10-27 06:12:03,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:03,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:03,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:03,442 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:03,443 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-10-27 06:12:03,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:03,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:03,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:03,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:03,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:03,446 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-10-27 06:12:03,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:03,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:03,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:03,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:03,452 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:03,453 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-10-27 06:12:03,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:03,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:03,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:03,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:03,461 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-10-27 06:12:03,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:03,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,462 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:12:03,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,463 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:12:03,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:03,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:03,469 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-10-27 06:12:03,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:03,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:03,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:03,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:03,476 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-10-27 06:12:03,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:03,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:03,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:03,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:03,482 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:03,482 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-10-27 06:12:03,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:03,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:03,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:03,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:03,486 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-10-27 06:12:03,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:03,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:03,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:03,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:03,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:03,492 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-10-27 06:12:03,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:03,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:03,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:03,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:03,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:03,495 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-10-27 06:12:03,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:03,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:03,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:03,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:03,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:03,501 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-10-27 06:12:03,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:03,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:03,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:03,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:03,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:03,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:03,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:03,512 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:03,515 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:12:03,515 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:12:03,517 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:03,518 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:12:03,518 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:03,518 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2018-10-27 06:12:03,519 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:12:03,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:03,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:03,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:03,750 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-10-27 06:12:03,750 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 138 states and 193 transitions. cyclomatic complexity: 56 Second operand 4 states. [2018-10-27 06:12:03,885 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 138 states and 193 transitions. cyclomatic complexity: 56. Second operand 4 states. Result 231 states and 342 transitions. Complement of second has 6 states. [2018-10-27 06:12:03,886 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-10-27 06:12:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:12:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2018-10-27 06:12:03,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 193 transitions. Stem has 45 letters. Loop has 32 letters. [2018-10-27 06:12:03,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:03,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 193 transitions. Stem has 77 letters. Loop has 32 letters. [2018-10-27 06:12:03,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:03,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 193 transitions. Stem has 45 letters. Loop has 64 letters. [2018-10-27 06:12:03,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:03,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 342 transitions. [2018-10-27 06:12:03,897 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:03,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 0 states and 0 transitions. [2018-10-27 06:12:03,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:12:03,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:12:03,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:12:03,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:03,900 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:03,900 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:03,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:03,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:03,900 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-10-27 06:12:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:03,900 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-10-27 06:12:03,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:12:03,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-10-27 06:12:03,901 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:03,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 06:12:03,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:12:03,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:12:03,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:12:03,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:03,901 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:03,901 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:03,901 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:03,901 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:12:03,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:12:03,902 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:03,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:12:03,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:12:03 BoogieIcfgContainer [2018-10-27 06:12:03,914 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:12:03,914 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:12:03,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:12:03,915 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:12:03,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:58" (3/4) ... [2018-10-27 06:12:03,917 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:12:03,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:12:03,918 INFO L168 Benchmark]: Toolchain (without parser) took 7439.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.1 MB). Free memory was 953.1 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 140.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:03,919 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:03,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.34 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 934.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:03,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.21 ms. Allocated memory is still 1.0 GB. Free memory was 934.3 MB in the beginning and 1.2 GB in the end (delta: -257.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:03,920 INFO L168 Benchmark]: Boogie Preprocessor took 60.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:03,921 INFO L168 Benchmark]: RCFGBuilder took 1044.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:03,921 INFO L168 Benchmark]: BuchiAutomizer took 5802.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 122.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:03,922 INFO L168 Benchmark]: Witness Printer took 3.09 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:03,927 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.34 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 934.3 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 65.21 ms. Allocated memory is still 1.0 GB. Free memory was 934.3 MB in the beginning and 1.2 GB in the end (delta: -257.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1044.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5802.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 122.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.09 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 138 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 624 SDtfs, 340 SDslu, 1155 SDs, 0 SdLazy, 22 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax121 hnf105 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms 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...