./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42c65bbe9265dd26dc791a1c83f008139e8490c7 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:31:08,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:31:08,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:31:08,741 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:31:08,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:31:08,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:31:08,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:31:08,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:31:08,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:31:08,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:31:08,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:31:08,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:31:08,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:31:08,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:31:08,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:31:08,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:31:08,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:31:08,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:31:08,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:31:08,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:31:08,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:31:08,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:31:08,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:31:08,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:31:08,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:31:08,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:31:08,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:31:08,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:31:08,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:31:08,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:31:08,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:31:08,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:31:08,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:31:08,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:31:08,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:31:08,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:31:08,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:31:08,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:31:08,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:31:08,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:31:08,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:31:08,779 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:31:08,798 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:31:08,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:31:08,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:31:08,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:31:08,800 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:31:08,800 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:31:08,801 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:31:08,801 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:31:08,801 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:31:08,801 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:31:08,801 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:31:08,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:31:08,802 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:31:08,802 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:31:08,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:31:08,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:31:08,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:31:08,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:31:08,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:31:08,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:31:08,804 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:31:08,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:31:08,804 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:31:08,807 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:31:08,808 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:31:08,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:31:08,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:31:08,808 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:31:08,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:31:08,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:31:08,809 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:31:08,810 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:31:08,811 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 42c65bbe9265dd26dc791a1c83f008139e8490c7 [2019-11-16 00:31:08,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:31:08,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:31:08,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:31:08,857 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:31:08,857 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:31:08,858 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c [2019-11-16 00:31:08,919 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/uautomizer/data/cf4f524eb/d691ae18e8bb4d9ab9d4de9f52cb0b4f/FLAG33a47146a [2019-11-16 00:31:09,398 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:31:09,402 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c [2019-11-16 00:31:09,423 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/uautomizer/data/cf4f524eb/d691ae18e8bb4d9ab9d4de9f52cb0b4f/FLAG33a47146a [2019-11-16 00:31:09,683 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/uautomizer/data/cf4f524eb/d691ae18e8bb4d9ab9d4de9f52cb0b4f [2019-11-16 00:31:09,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:31:09,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:31:09,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:31:09,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:31:09,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:31:09,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:31:09" (1/1) ... [2019-11-16 00:31:09,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7151a79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09, skipping insertion in model container [2019-11-16 00:31:09,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:31:09" (1/1) ... [2019-11-16 00:31:09,707 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:31:09,750 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:31:10,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:31:10,086 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:31:10,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:31:10,168 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:31:10,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:10 WrapperNode [2019-11-16 00:31:10,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:31:10,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:31:10,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:31:10,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:31:10,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:10" (1/1) ... [2019-11-16 00:31:10,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:10" (1/1) ... [2019-11-16 00:31:10,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:31:10,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:31:10,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:31:10,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:31:10,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:10" (1/1) ... [2019-11-16 00:31:10,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:10" (1/1) ... [2019-11-16 00:31:10,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:10" (1/1) ... [2019-11-16 00:31:10,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:10" (1/1) ... [2019-11-16 00:31:10,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:10" (1/1) ... [2019-11-16 00:31:10,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:10" (1/1) ... [2019-11-16 00:31:10,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:10" (1/1) ... [2019-11-16 00:31:10,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:31:10,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:31:10,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:31:10,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:31:10,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:31:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:31:10,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:31:11,324 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:31:11,324 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-16 00:31:11,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:31:11 BoogieIcfgContainer [2019-11-16 00:31:11,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:31:11,327 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:31:11,327 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:31:11,330 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:31:11,331 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:31:11,331 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:31:09" (1/3) ... [2019-11-16 00:31:11,332 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70bffa3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:31:11, skipping insertion in model container [2019-11-16 00:31:11,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:31:11,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:10" (2/3) ... [2019-11-16 00:31:11,333 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70bffa3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:31:11, skipping insertion in model container [2019-11-16 00:31:11,333 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:31:11,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:31:11" (3/3) ... [2019-11-16 00:31:11,337 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c [2019-11-16 00:31:11,383 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:31:11,383 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:31:11,383 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:31:11,383 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:31:11,384 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:31:11,384 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:31:11,384 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:31:11,384 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:31:11,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states. [2019-11-16 00:31:11,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2019-11-16 00:31:11,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:31:11,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:31:11,452 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:31:11,452 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:11,452 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:31:11,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states. [2019-11-16 00:31:11,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2019-11-16 00:31:11,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:31:11,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:31:11,464 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:31:11,464 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:11,477 INFO L791 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~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]; 12#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 45#L290true assume !(0 == ~r1~0);init_~tmp~0 := 0; 44#L290-1true init_#res := init_~tmp~0; 53#L419true main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume 0 != main_~i2~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;main_~i2~0 := 0; 46#L488-2true [2019-11-16 00:31:11,478 INFO L793 eck$LassoCheckResult]: Loop: 46#L488-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 103#L118true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 34#L122true assume !(node1_~m1~0 != ~nomsg~0); 49#L122-1true ~mode1~0 := 0; 89#L118-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 19#L153true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 113#L156true assume !(node2_~m2~0 != ~nomsg~0); 112#L156-1true ~mode2~0 := 0; 17#L153-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 83#L187true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 71#L190true assume !(node3_~m3~0 != ~nomsg~0); 69#L190-1true ~mode3~0 := 0; 94#L187-2true havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 39#L221true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 43#L224true assume !(node4_~m4~0 != ~nomsg~0); 42#L224-1true ~mode4~0 := 0; 35#L221-2true havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 13#L255true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 119#L258true assume !(node5_~m5~0 != ~nomsg~0); 118#L258-1true ~mode5~0 := 0; 114#L255-2true ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 70#L427true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 72#L427-1true check_#res := check_~tmp~1; 22#L439true main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 64#L518true assume !(0 == assert_~arg % 256); 38#L513true main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 46#L488-2true [2019-11-16 00:31:11,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:11,484 INFO L82 PathProgramCache]: Analyzing trace with hash 28880448, now seen corresponding path program 1 times [2019-11-16 00:31:11,491 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:11,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543729223] [2019-11-16 00:31:11,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:11,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:11,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:11,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543729223] [2019-11-16 00:31:11,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:11,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:31:11,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244216356] [2019-11-16 00:31:11,709 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:31:11,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:11,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1515995822, now seen corresponding path program 1 times [2019-11-16 00:31:11,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:11,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537480166] [2019-11-16 00:31:11,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:11,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:11,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:11,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537480166] [2019-11-16 00:31:11,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:11,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:31:11,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079205237] [2019-11-16 00:31:11,921 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:31:11,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:11,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:31:11,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:31:11,942 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 4 states. [2019-11-16 00:31:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:12,094 INFO L93 Difference]: Finished difference Result 121 states and 200 transitions. [2019-11-16 00:31:12,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:31:12,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 200 transitions. [2019-11-16 00:31:12,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-11-16 00:31:12,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 114 states and 162 transitions. [2019-11-16 00:31:12,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2019-11-16 00:31:12,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2019-11-16 00:31:12,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 162 transitions. [2019-11-16 00:31:12,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:31:12,134 INFO L688 BuchiCegarLoop]: Abstraction has 114 states and 162 transitions. [2019-11-16 00:31:12,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 162 transitions. [2019-11-16 00:31:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-16 00:31:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-16 00:31:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2019-11-16 00:31:12,178 INFO L711 BuchiCegarLoop]: Abstraction has 114 states and 162 transitions. [2019-11-16 00:31:12,178 INFO L591 BuchiCegarLoop]: Abstraction has 114 states and 162 transitions. [2019-11-16 00:31:12,178 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:31:12,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 162 transitions. [2019-11-16 00:31:12,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-11-16 00:31:12,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:31:12,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:31:12,184 INFO L849 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] [2019-11-16 00:31:12,184 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:12,185 INFO L791 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~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]; 271#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 272#L290 assume 0 == ~r1~0; 329#L291 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 359#L292 assume ~id1~0 >= 0; 290#L293 assume 0 == ~st1~0; 291#L294 assume ~send1~0 == ~id1~0; 337#L295 assume 0 == ~mode1~0 % 256; 267#L296 assume ~id2~0 >= 0; 268#L297 assume 0 == ~st2~0; 342#L298 assume ~send2~0 == ~id2~0; 280#L299 assume 0 == ~mode2~0 % 256; 281#L300 assume ~id3~0 >= 0; 330#L301 assume 0 == ~st3~0; 331#L302 assume ~send3~0 == ~id3~0; 348#L303 assume 0 == ~mode3~0 % 256; 306#L304 assume ~id4~0 >= 0; 307#L305 assume 0 == ~st4~0; 344#L306 assume ~send4~0 == ~id4~0; 278#L307 assume 0 == ~mode4~0 % 256; 279#L308 assume ~id5~0 >= 0; 339#L309 assume 0 == ~st5~0; 265#L310 assume ~send5~0 == ~id5~0; 266#L311 assume 0 == ~mode5~0 % 256; 314#L312 assume ~id1~0 != ~id2~0; 315#L313 assume ~id1~0 != ~id3~0; 358#L314 assume ~id1~0 != ~id4~0; 304#L315 assume ~id1~0 != ~id5~0; 305#L316 assume ~id2~0 != ~id3~0; 343#L317 assume ~id2~0 != ~id4~0; 276#L318 assume ~id2~0 != ~id5~0; 277#L319 assume ~id3~0 != ~id4~0; 338#L320 assume ~id3~0 != ~id5~0; 263#L321 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 264#L290-1 init_#res := init_~tmp~0; 328#L419 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume 0 != main_~i2~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;main_~i2~0 := 0; 319#L488-2 [2019-11-16 00:31:12,185 INFO L793 eck$LassoCheckResult]: Loop: 319#L488-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 332#L118 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 311#L122 assume !(node1_~m1~0 != ~nomsg~0); 313#L122-1 ~mode1~0 := 0; 270#L118-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 285#L153 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 287#L156 assume !(node2_~m2~0 != ~nomsg~0); 299#L156-1 ~mode2~0 := 0; 282#L153-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 283#L187 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 353#L190 assume !(node3_~m3~0 != ~nomsg~0); 324#L190-1 ~mode3~0 := 0; 346#L187-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 320#L221 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 321#L224 assume !(node4_~m4~0 != ~nomsg~0); 326#L224-1 ~mode4~0 := 0; 256#L221-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 273#L255 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 275#L258 assume !(node5_~m5~0 != ~nomsg~0); 262#L258-1 ~mode5~0 := 0; 361#L255-2 ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 352#L427 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 289#L427-1 check_#res := check_~tmp~1; 292#L439 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 293#L518 assume !(0 == assert_~arg % 256); 318#L513 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 319#L488-2 [2019-11-16 00:31:12,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:12,185 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 1 times [2019-11-16 00:31:12,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:12,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393028967] [2019-11-16 00:31:12,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:12,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:12,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:12,335 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:12,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:12,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1515995822, now seen corresponding path program 2 times [2019-11-16 00:31:12,337 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:12,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140916207] [2019-11-16 00:31:12,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:12,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:12,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:12,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140916207] [2019-11-16 00:31:12,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:12,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:31:12,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776784487] [2019-11-16 00:31:12,444 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:31:12,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:12,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:31:12,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:31:12,445 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. cyclomatic complexity: 49 Second operand 5 states. [2019-11-16 00:31:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:12,541 INFO L93 Difference]: Finished difference Result 117 states and 164 transitions. [2019-11-16 00:31:12,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:31:12,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 164 transitions. [2019-11-16 00:31:12,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-11-16 00:31:12,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 114 states and 160 transitions. [2019-11-16 00:31:12,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2019-11-16 00:31:12,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2019-11-16 00:31:12,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 160 transitions. [2019-11-16 00:31:12,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:31:12,554 INFO L688 BuchiCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-11-16 00:31:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 160 transitions. [2019-11-16 00:31:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-16 00:31:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-16 00:31:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2019-11-16 00:31:12,564 INFO L711 BuchiCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-11-16 00:31:12,564 INFO L591 BuchiCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-11-16 00:31:12,564 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:31:12,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 160 transitions. [2019-11-16 00:31:12,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-11-16 00:31:12,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:31:12,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:31:12,569 INFO L849 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] [2019-11-16 00:31:12,569 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:12,569 INFO L791 eck$LassoCheckResult]: Stem: 606#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~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]; 514#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 515#L290 assume 0 == ~r1~0; 572#L291 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 602#L292 assume ~id1~0 >= 0; 533#L293 assume 0 == ~st1~0; 534#L294 assume ~send1~0 == ~id1~0; 580#L295 assume 0 == ~mode1~0 % 256; 510#L296 assume ~id2~0 >= 0; 511#L297 assume 0 == ~st2~0; 585#L298 assume ~send2~0 == ~id2~0; 523#L299 assume 0 == ~mode2~0 % 256; 524#L300 assume ~id3~0 >= 0; 573#L301 assume 0 == ~st3~0; 574#L302 assume ~send3~0 == ~id3~0; 591#L303 assume 0 == ~mode3~0 % 256; 549#L304 assume ~id4~0 >= 0; 550#L305 assume 0 == ~st4~0; 587#L306 assume ~send4~0 == ~id4~0; 521#L307 assume 0 == ~mode4~0 % 256; 522#L308 assume ~id5~0 >= 0; 582#L309 assume 0 == ~st5~0; 508#L310 assume ~send5~0 == ~id5~0; 509#L311 assume 0 == ~mode5~0 % 256; 557#L312 assume ~id1~0 != ~id2~0; 558#L313 assume ~id1~0 != ~id3~0; 601#L314 assume ~id1~0 != ~id4~0; 547#L315 assume ~id1~0 != ~id5~0; 548#L316 assume ~id2~0 != ~id3~0; 586#L317 assume ~id2~0 != ~id4~0; 519#L318 assume ~id2~0 != ~id5~0; 520#L319 assume ~id3~0 != ~id4~0; 581#L320 assume ~id3~0 != ~id5~0; 506#L321 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 507#L290-1 init_#res := init_~tmp~0; 571#L419 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume 0 != main_~i2~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;main_~i2~0 := 0; 562#L488-2 [2019-11-16 00:31:12,570 INFO L793 eck$LassoCheckResult]: Loop: 562#L488-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 575#L118 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 554#L122 assume !(node1_~m1~0 != ~nomsg~0); 556#L122-1 ~mode1~0 := 0; 513#L118-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 528#L153 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 530#L156 assume !(node2_~m2~0 != ~nomsg~0); 542#L156-1 ~mode2~0 := 0; 525#L153-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 526#L187 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 596#L190 assume !(node3_~m3~0 != ~nomsg~0); 567#L190-1 ~mode3~0 := 0; 589#L187-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 563#L221 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 564#L224 assume !(node4_~m4~0 != ~nomsg~0); 569#L224-1 ~mode4~0 := 0; 499#L221-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 516#L255 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 518#L258 assume !(node5_~m5~0 != ~nomsg~0); 505#L258-1 ~mode5~0 := 0; 604#L255-2 ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 595#L427 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 537#L428 assume ~r1~0 < 5;check_~tmp~1 := 1; 532#L427-1 check_#res := check_~tmp~1; 535#L439 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 536#L518 assume !(0 == assert_~arg % 256); 561#L513 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 562#L488-2 [2019-11-16 00:31:12,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:12,570 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 2 times [2019-11-16 00:31:12,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:12,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102179418] [2019-11-16 00:31:12,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:12,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:12,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:12,662 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:12,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:12,665 INFO L82 PathProgramCache]: Analyzing trace with hash -632096835, now seen corresponding path program 1 times [2019-11-16 00:31:12,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:12,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911474077] [2019-11-16 00:31:12,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:12,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:12,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:12,735 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:12,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:12,735 INFO L82 PathProgramCache]: Analyzing trace with hash -525921879, now seen corresponding path program 1 times [2019-11-16 00:31:12,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:12,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684672168] [2019-11-16 00:31:12,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:12,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:12,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:12,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684672168] [2019-11-16 00:31:12,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:12,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:31:12,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361357415] [2019-11-16 00:31:13,532 WARN L191 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 137 [2019-11-16 00:31:14,805 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 123 DAG size of output: 118 [2019-11-16 00:31:14,822 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:31:14,825 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:31:14,825 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:31:14,825 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:31:14,825 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:31:14,826 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:31:14,826 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:31:14,826 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:31:14,826 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2019-11-16 00:31:14,826 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:31:14,829 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:31:14,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:14,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:15,567 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-16 00:31:16,005 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-16 00:31:16,080 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:31:16,081 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/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 [2019-11-16 00:31:16,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:31:16,102 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a8379a7-bb5d-4866-a02c-112b808ada3b/bin/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 [2019-11-16 00:31:16,125 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:31:16,125 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:31:16,298 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:31:16,300 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:31:16,300 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:31:16,300 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:31:16,300 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:31:16,300 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:31:16,301 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:31:16,301 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:31:16,301 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:31:16,301 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2019-11-16 00:31:16,301 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:31:16,301 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:31:16,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:31:16,803 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-16 00:31:17,184 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-16 00:31:17,386 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:31:17,391 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:31:17,393 INFO L120 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 [2019-11-16 00:31:17,395 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,395 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:17,396 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,396 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,396 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,398 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:17,398 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:17,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,403 INFO L120 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 [2019-11-16 00:31:17,403 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,404 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,404 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,404 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,407 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:17,407 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:17,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,409 INFO L120 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 [2019-11-16 00:31:17,410 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,410 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:17,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,411 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,417 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:17,418 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:17,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,423 INFO L120 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 [2019-11-16 00:31:17,424 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,426 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:17,427 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:17,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,430 INFO L120 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 [2019-11-16 00:31:17,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,431 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:17,431 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,432 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:17,433 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:17,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,436 INFO L120 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 [2019-11-16 00:31:17,436 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,436 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:17,437 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,437 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,437 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,438 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:17,438 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:17,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,439 INFO L120 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 [2019-11-16 00:31:17,440 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,440 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,440 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,440 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,442 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:17,442 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:17,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,445 INFO L120 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 [2019-11-16 00:31:17,446 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,446 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:17,447 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,447 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:31:17,447 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,449 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:31:17,449 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:17,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,454 INFO L120 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 [2019-11-16 00:31:17,455 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:17,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,456 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,456 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,456 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:17,457 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:17,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,459 INFO L120 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 [2019-11-16 00:31:17,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,461 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,461 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,462 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:17,462 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:17,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,466 INFO L120 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 [2019-11-16 00:31:17,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,467 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:17,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,467 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,468 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:17,468 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:17,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,469 INFO L120 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 [2019-11-16 00:31:17,470 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,470 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:17,471 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,471 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,471 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:17,472 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:17,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,473 INFO L120 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 [2019-11-16 00:31:17,474 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,474 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:17,474 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,474 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,474 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,475 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:17,475 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:17,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,476 INFO L120 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 [2019-11-16 00:31:17,477 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,477 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:17,477 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,478 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,478 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,478 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:17,478 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:17,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,480 INFO L120 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 [2019-11-16 00:31:17,480 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,481 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:17,481 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,481 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,481 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,482 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:17,482 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:17,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,483 INFO L120 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 [2019-11-16 00:31:17,484 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,484 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,484 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,485 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,486 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:17,486 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:17,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,489 INFO L120 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 [2019-11-16 00:31:17,490 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,490 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:17,490 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,491 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,491 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,491 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:17,491 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:17,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,493 INFO L120 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 [2019-11-16 00:31:17,493 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,494 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:17,494 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,494 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,494 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,495 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:17,495 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:17,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:17,498 INFO L120 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 [2019-11-16 00:31:17,499 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:17,499 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:17,499 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:17,499 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:17,499 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:17,500 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:17,500 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:17,502 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:31:17,506 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:31:17,507 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:31:17,509 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:31:17,509 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:31:17,510 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:31:17,510 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2019-11-16 00:31:17,512 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:31:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:17,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:31:17,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:31:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:17,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:31:17,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:31:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:17,722 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 [2019-11-16 00:31:17,723 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 160 transitions. cyclomatic complexity: 47 Second operand 3 states. [2019-11-16 00:31:17,822 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 160 transitions. cyclomatic complexity: 47. Second operand 3 states. Result 192 states and 285 transitions. Complement of second has 4 states. [2019-11-16 00:31:17,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:31:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:31:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2019-11-16 00:31:17,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 160 transitions. Stem has 36 letters. Loop has 27 letters. [2019-11-16 00:31:17,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:31:17,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 160 transitions. Stem has 63 letters. Loop has 27 letters. [2019-11-16 00:31:17,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:31:17,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 160 transitions. Stem has 36 letters. Loop has 54 letters. [2019-11-16 00:31:17,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:31:17,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 285 transitions. [2019-11-16 00:31:17,837 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:31:17,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 0 states and 0 transitions. [2019-11-16 00:31:17,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:31:17,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:31:17,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:31:17,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:31:17,838 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:31:17,839 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:31:17,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:17,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:31:17,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:31:17,840 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-16 00:31:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:17,840 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-16 00:31:17,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:31:17,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-16 00:31:17,841 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:31:17,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:31:17,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:31:17,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:31:17,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:31:17,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:31:17,843 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:31:17,843 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:31:17,843 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:31:17,843 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:31:17,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:31:17,844 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:31:17,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:31:17,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:31:17 BoogieIcfgContainer [2019-11-16 00:31:17,852 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:31:17,852 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:31:17,852 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:31:17,853 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:31:17,853 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:31:11" (3/4) ... [2019-11-16 00:31:17,861 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:31:17,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:31:17,864 INFO L168 Benchmark]: Toolchain (without parser) took 8175.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 944.7 MB in the beginning and 925.5 MB in the end (delta: 19.2 MB). Peak memory consumption was 215.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:17,865 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:31:17,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 480.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:17,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:17,868 INFO L168 Benchmark]: Boogie Preprocessor took 61.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:31:17,870 INFO L168 Benchmark]: RCFGBuilder took 1031.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:17,875 INFO L168 Benchmark]: BuchiAutomizer took 6525.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 925.5 MB in the end (delta: 151.6 MB). Peak memory consumption was 204.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:17,876 INFO L168 Benchmark]: Witness Printer took 9.52 ms. Allocated memory is still 1.2 GB. Free memory is still 925.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:31:17,881 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 480.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1031.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6525.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 925.5 MB in the end (delta: 151.6 MB). Peak memory consumption was 204.5 MB. Max. memory is 11.5 GB. * Witness Printer took 9.52 ms. Allocated memory is still 1.2 GB. Free memory is still 925.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.6s. Construction of modules took 0.1s. 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 114 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 516 SDtfs, 161 SDslu, 956 SDs, 0 SdLazy, 22 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital303 mio100 ax120 hnf105 lsp16 ukn100 mio100 lsp100 div103 bol100 ite100 ukn100 eq221 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.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...