./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a90b25a4abf3a535ee7c4ba6368944b8e32b5ef5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:02:33,699 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:02:33,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:02:33,706 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:02:33,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:02:33,707 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:02:33,708 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:02:33,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:02:33,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:02:33,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:02:33,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:02:33,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:02:33,712 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:02:33,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:02:33,714 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:02:33,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:02:33,715 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:02:33,716 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:02:33,717 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:02:33,718 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:02:33,719 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:02:33,720 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:02:33,721 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:02:33,721 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:02:33,722 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:02:33,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:02:33,723 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:02:33,723 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:02:33,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:02:33,724 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:02:33,724 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:02:33,725 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:02:33,725 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:02:33,725 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:02:33,725 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:02:33,726 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:02:33,726 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 13:02:33,736 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:02:33,736 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:02:33,738 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:02:33,738 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:02:33,738 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:02:33,738 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:02:33,738 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:02:33,738 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:02:33,739 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:02:33,739 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:02:33,739 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:02:33,739 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:02:33,739 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:02:33,739 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:02:33,739 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:02:33,740 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:02:33,740 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:02:33,740 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:02:33,740 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:02:33,740 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:02:33,740 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:02:33,740 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:02:33,741 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:02:33,741 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:02:33,741 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:02:33,741 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:02:33,741 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:02:33,741 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:02:33,742 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:02:33,742 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:02:33,742 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:02:33,743 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:02:33,743 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a90b25a4abf3a535ee7c4ba6368944b8e32b5ef5 [2018-11-18 13:02:33,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:02:33,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:02:33,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:02:33,779 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:02:33,780 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:02:33,780 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 13:02:33,827 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer/data/dabe2b12f/9bb1c35240504d18a85bd80adf220532/FLAGf013bdc80 [2018-11-18 13:02:34,239 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:02:34,239 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 13:02:34,244 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer/data/dabe2b12f/9bb1c35240504d18a85bd80adf220532/FLAGf013bdc80 [2018-11-18 13:02:34,254 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer/data/dabe2b12f/9bb1c35240504d18a85bd80adf220532 [2018-11-18 13:02:34,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:02:34,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:02:34,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:02:34,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:02:34,261 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:02:34,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:02:34" (1/1) ... [2018-11-18 13:02:34,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c3b532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:02:34, skipping insertion in model container [2018-11-18 13:02:34,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:02:34" (1/1) ... [2018-11-18 13:02:34,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:02:34,297 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:02:34,442 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:02:34,451 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:02:34,475 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:02:34,523 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:02:34,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:02:34 WrapperNode [2018-11-18 13:02:34,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:02:34,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:02:34,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:02:34,524 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:02:34,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:02:34" (1/1) ... [2018-11-18 13:02:34,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:02:34" (1/1) ... [2018-11-18 13:02:34,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:02:34,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:02:34,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:02:34,552 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:02:34,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:02:34" (1/1) ... [2018-11-18 13:02:34,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:02:34" (1/1) ... [2018-11-18 13:02:34,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:02:34" (1/1) ... [2018-11-18 13:02:34,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:02:34" (1/1) ... [2018-11-18 13:02:34,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:02:34" (1/1) ... [2018-11-18 13:02:34,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:02:34" (1/1) ... [2018-11-18 13:02:34,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:02:34" (1/1) ... [2018-11-18 13:02:34,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:02:34,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:02:34,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:02:34,569 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:02:34,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:02:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:02:34,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:02:34,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:02:34,913 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:02:34,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:02:34 BoogieIcfgContainer [2018-11-18 13:02:34,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:02:34,914 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:02:34,914 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:02:34,917 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:02:34,918 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:02:34,918 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:02:34" (1/3) ... [2018-11-18 13:02:34,919 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21756df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:02:34, skipping insertion in model container [2018-11-18 13:02:34,919 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:02:34,919 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:02:34" (2/3) ... [2018-11-18 13:02:34,920 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21756df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:02:34, skipping insertion in model container [2018-11-18 13:02:34,920 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:02:34,920 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:02:34" (3/3) ... [2018-11-18 13:02:34,921 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 13:02:34,955 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:02:34,955 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:02:34,955 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:02:34,956 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:02:34,956 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:02:34,956 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:02:34,956 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:02:34,956 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:02:34,956 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:02:34,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. [2018-11-18 13:02:34,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-18 13:02:34,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:02:34,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:02:34,992 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:02:34,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:02:34,993 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:02:34,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. [2018-11-18 13:02:34,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-18 13:02:34,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:02:34,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:02:34,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:02:34,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:02:35,003 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 3#L175true assume !(0 == ~r1~0);init_~tmp~0 := 0; 22#L175-1true init_#res := init_~tmp~0; 54#L240true main_#t~ret16 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;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;main_~i2~0 := 0; 12#L300-3true [2018-11-18 13:02:35,004 INFO L796 eck$LassoCheckResult]: Loop: 12#L300-3true assume true; 36#L300-1true assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 41#L99true assume !(0 != ~mode1~0 % 256); 6#L113true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 4#L113-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 38#L99-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 30#L125true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 35#L128true assume !(node2_~m2~0 != ~nomsg~0); 33#L128-1true ~mode2~0 := 0; 27#L125-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 37#L150true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 23#L153true assume !(node3_~m3~0 != ~nomsg~0); 19#L153-1true ~mode3~0 := 0; 13#L150-2true assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 20#L248true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 18#L248-1true check_#res := check_~tmp~1; 51#L268true main_#t~ret17 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 53#L324true assume !(0 == assert_~arg % 256); 47#L319true assume { :end_inline_assert } true;main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 12#L300-3true [2018-11-18 13:02:35,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:02:35,009 INFO L82 PathProgramCache]: Analyzing trace with hash 28785120, now seen corresponding path program 1 times [2018-11-18 13:02:35,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:02:35,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:02:35,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:02:35,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:02:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:02:35,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:02:35,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:02:35,141 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:02:35,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:02:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash -665068755, now seen corresponding path program 1 times [2018-11-18 13:02:35,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:02:35,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:02:35,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:02:35,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:02:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:02:35,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:02:35,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:02:35,216 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:02:35,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:02:35,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:02:35,230 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 4 states. [2018-11-18 13:02:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:02:35,295 INFO L93 Difference]: Finished difference Result 62 states and 97 transitions. [2018-11-18 13:02:35,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:02:35,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 97 transitions. [2018-11-18 13:02:35,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-18 13:02:35,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 55 states and 75 transitions. [2018-11-18 13:02:35,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-18 13:02:35,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-18 13:02:35,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 75 transitions. [2018-11-18 13:02:35,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:02:35,303 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2018-11-18 13:02:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 75 transitions. [2018-11-18 13:02:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-18 13:02:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 13:02:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2018-11-18 13:02:35,329 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2018-11-18 13:02:35,329 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2018-11-18 13:02:35,329 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:02:35,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2018-11-18 13:02:35,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-18 13:02:35,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:02:35,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:02:35,331 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:02:35,331 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:02:35,331 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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]; 157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 137#L175 assume 0 == ~r1~0; 138#L176 assume ~id1~0 >= 0; 167#L177 assume 0 == ~st1~0; 185#L178 assume ~send1~0 == ~id1~0; 149#L179 assume 0 == ~mode1~0 % 256; 150#L180 assume ~id2~0 >= 0; 177#L181 assume 0 == ~st2~0; 160#L182 assume ~send2~0 == ~id2~0; 161#L183 assume 0 == ~mode2~0 % 256; 183#L184 assume ~id3~0 >= 0; 190#L185 assume 0 == ~st3~0; 141#L186 assume ~send3~0 == ~id3~0; 142#L187 assume 0 == ~mode3~0 % 256; 168#L188 assume ~id1~0 != ~id2~0; 186#L189 assume ~id1~0 != ~id3~0; 151#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 152#L175-1 init_#res := init_~tmp~0; 164#L240 main_#t~ret16 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;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;main_~i2~0 := 0; 153#L300-3 [2018-11-18 13:02:35,331 INFO L796 eck$LassoCheckResult]: Loop: 153#L300-3 assume true; 154#L300-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 181#L99 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 172#L103 assume !(node1_~m1~0 != ~nomsg~0); 171#L103-1 ~mode1~0 := 0; 140#L99-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 175#L125 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 176#L128 assume !(node2_~m2~0 != ~nomsg~0); 178#L128-1 ~mode2~0 := 0; 169#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 170#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 165#L153 assume !(node3_~m3~0 != ~nomsg~0); 148#L153-1 ~mode3~0 := 0; 155#L150-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 156#L248 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 145#L248-1 check_#res := check_~tmp~1; 162#L268 main_#t~ret17 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 189#L324 assume !(0 == assert_~arg % 256); 188#L319 assume { :end_inline_assert } true;main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 153#L300-3 [2018-11-18 13:02:35,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:02:35,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 1 times [2018-11-18 13:02:35,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:02:35,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:02:35,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:02:35,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:02:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:02:35,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:02:35,373 INFO L82 PathProgramCache]: Analyzing trace with hash 929215927, now seen corresponding path program 1 times [2018-11-18 13:02:35,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:02:35,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:02:35,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:02:35,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:02:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:02:35,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:02:35,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:02:35,440 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:02:35,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:02:35,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:02:35,441 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-18 13:02:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:02:35,473 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-18 13:02:35,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:02:35,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 77 transitions. [2018-11-18 13:02:35,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-18 13:02:35,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 72 transitions. [2018-11-18 13:02:35,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-18 13:02:35,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-18 13:02:35,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 72 transitions. [2018-11-18 13:02:35,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:02:35,477 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-18 13:02:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 72 transitions. [2018-11-18 13:02:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-18 13:02:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 13:02:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2018-11-18 13:02:35,481 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-18 13:02:35,481 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-18 13:02:35,481 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:02:35,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 72 transitions. [2018-11-18 13:02:35,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-18 13:02:35,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:02:35,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:02:35,483 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:02:35,483 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:02:35,484 INFO L794 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 262#L175 assume 0 == ~r1~0; 263#L176 assume ~id1~0 >= 0; 292#L177 assume 0 == ~st1~0; 310#L178 assume ~send1~0 == ~id1~0; 273#L179 assume 0 == ~mode1~0 % 256; 274#L180 assume ~id2~0 >= 0; 302#L181 assume 0 == ~st2~0; 284#L182 assume ~send2~0 == ~id2~0; 285#L183 assume 0 == ~mode2~0 % 256; 308#L184 assume ~id3~0 >= 0; 315#L185 assume 0 == ~st3~0; 266#L186 assume ~send3~0 == ~id3~0; 267#L187 assume 0 == ~mode3~0 % 256; 293#L188 assume ~id1~0 != ~id2~0; 311#L189 assume ~id1~0 != ~id3~0; 275#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 276#L175-1 init_#res := init_~tmp~0; 289#L240 main_#t~ret16 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;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;main_~i2~0 := 0; 277#L300-3 [2018-11-18 13:02:35,484 INFO L796 eck$LassoCheckResult]: Loop: 277#L300-3 assume true; 278#L300-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 306#L99 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 297#L103 assume !(node1_~m1~0 != ~nomsg~0); 296#L103-1 ~mode1~0 := 0; 265#L99-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 299#L125 assume !(0 != ~mode2~0 % 256); 282#L138 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 283#L138-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 294#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 295#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 290#L153 assume !(node3_~m3~0 != ~nomsg~0); 272#L153-1 ~mode3~0 := 0; 279#L150-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 280#L248 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 288#L249 assume ~r1~0 >= 3; 270#L253 assume ~r1~0 < 3;check_~tmp~1 := 1; 286#L248-1 check_#res := check_~tmp~1; 287#L268 main_#t~ret17 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 314#L324 assume !(0 == assert_~arg % 256); 313#L319 assume { :end_inline_assert } true;main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 277#L300-3 [2018-11-18 13:02:35,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:02:35,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 2 times [2018-11-18 13:02:35,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:02:35,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:02:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:02:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:02:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:02:35,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:02:35,512 INFO L82 PathProgramCache]: Analyzing trace with hash 704146717, now seen corresponding path program 1 times [2018-11-18 13:02:35,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:02:35,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:02:35,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:02:35,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:02:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:02:35,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:02:35,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:02:35,554 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:02:35,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:02:35,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:02:35,554 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. cyclomatic complexity: 18 Second operand 3 states. [2018-11-18 13:02:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:02:35,577 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2018-11-18 13:02:35,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:02:35,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2018-11-18 13:02:35,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2018-11-18 13:02:35,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2018-11-18 13:02:35,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-11-18 13:02:35,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2018-11-18 13:02:35,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2018-11-18 13:02:35,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:02:35,581 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2018-11-18 13:02:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2018-11-18 13:02:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-18 13:02:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 13:02:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2018-11-18 13:02:35,585 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2018-11-18 13:02:35,586 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2018-11-18 13:02:35,586 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:02:35,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2018-11-18 13:02:35,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2018-11-18 13:02:35,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:02:35,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:02:35,587 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:02:35,588 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:02:35,588 INFO L794 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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]; 426#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 409#L175 assume 0 == ~r1~0; 410#L176 assume ~id1~0 >= 0; 437#L177 assume 0 == ~st1~0; 457#L178 assume ~send1~0 == ~id1~0; 418#L179 assume 0 == ~mode1~0 % 256; 419#L180 assume ~id2~0 >= 0; 449#L181 assume 0 == ~st2~0; 429#L182 assume ~send2~0 == ~id2~0; 430#L183 assume 0 == ~mode2~0 % 256; 455#L184 assume ~id3~0 >= 0; 462#L185 assume 0 == ~st3~0; 411#L186 assume ~send3~0 == ~id3~0; 412#L187 assume 0 == ~mode3~0 % 256; 440#L188 assume ~id1~0 != ~id2~0; 458#L189 assume ~id1~0 != ~id3~0; 420#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 421#L175-1 init_#res := init_~tmp~0; 434#L240 main_#t~ret16 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;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;main_~i2~0 := 0; 463#L300-3 [2018-11-18 13:02:35,588 INFO L796 eck$LassoCheckResult]: Loop: 463#L300-3 assume true; 486#L300-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 485#L99 assume !(0 != ~mode1~0 % 256); 484#L113 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 483#L113-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 442#L99-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 482#L125 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 480#L128 assume !(node2_~m2~0 != ~nomsg~0); 476#L128-1 ~mode2~0 := 0; 475#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 474#L150 assume !(0 != ~mode3~0 % 256); 470#L163 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 469#L163-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 467#L150-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 466#L248 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 465#L249 assume !(~r1~0 >= 3); 414#L252 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 415#L253 assume ~r1~0 < 3;check_~tmp~1 := 1; 490#L248-1 check_#res := check_~tmp~1; 489#L268 main_#t~ret17 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 488#L324 assume !(0 == assert_~arg % 256); 487#L319 assume { :end_inline_assert } true;main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 463#L300-3 [2018-11-18 13:02:35,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:02:35,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 3 times [2018-11-18 13:02:35,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:02:35,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:02:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:02:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:02:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:02:35,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:02:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1445837692, now seen corresponding path program 1 times [2018-11-18 13:02:35,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:02:35,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:02:35,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:02:35,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:02:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:02:35,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:02:35,630 INFO L82 PathProgramCache]: Analyzing trace with hash -525546760, now seen corresponding path program 1 times [2018-11-18 13:02:35,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:02:35,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:02:35,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:02:35,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:02:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:02:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:02:35,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:02:35,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:02:35,861 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2018-11-18 13:02:36,519 WARN L180 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2018-11-18 13:02:36,526 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:02:36,527 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:02:36,527 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:02:36,528 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:02:36,528 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:02:36,528 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:02:36,528 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:02:36,528 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:02:36,528 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-18 13:02:36,528 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:02:36,528 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:02:36,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:36,817 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 13:02:38,934 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 143 DAG size of output: 95 [2018-11-18 13:02:38,981 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:02:38,982 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:02:38,986 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:02:38,986 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee7667e1-36cf-4557-860e-cff19616c406/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:02:39,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:02:39,005 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:02:39,101 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:02:39,102 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:02:39,103 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:02:39,103 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:02:39,103 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:02:39,103 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:02:39,103 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:02:39,103 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:02:39,103 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:02:39,103 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-18 13:02:39,103 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:02:39,103 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:02:39,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:02:39,381 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 13:02:41,365 WARN L180 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 143 DAG size of output: 95 [2018-11-18 13:02:41,406 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:02:41,410 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:02:41,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:02:41,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:02:41,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:02:41,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:02:41,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:02:41,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:02:41,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:02:41,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:02:41,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:02:41,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:02:41,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:02:41,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:02:41,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:02:41,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:02:41,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:02:41,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,428 INFO L206 nArgumentSynthesizer]: 16 loop disjuncts [2018-11-18 13:02:41,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,461 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2018-11-18 13:02:41,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:02:41,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:02:41,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:02:41,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:02:41,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:02:41,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:02:41,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:02:41,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:02:41,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:02:41,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:02:41,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:02:41,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:02:41,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:02:41,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:02:41,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:02:41,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:02:41,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:02:41,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:02:41,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:02:41,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:02:41,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:02:41,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:02:41,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:02:41,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:02:41,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:02:41,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:02:41,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:02:41,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:02:41,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:02:41,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:02:41,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:02:41,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:02:41,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:02:41,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:02:41,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:02:41,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:02:41,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:02:41,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:02:41,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:02:41,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:02:41,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:02:41,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:02:41,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:02:41,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:02:41,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:02:41,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:02:41,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:02:41,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:02:41,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:02:41,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:02:41,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:02:41,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:02:41,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:02:41,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:02:41,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:02:41,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:02:41,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:02:41,547 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:02:41,549 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:02:41,550 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:02:41,551 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:02:41,551 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:02:41,552 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:02:41,552 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2018-11-18 13:02:41,553 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:02:41,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:02:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:02:41,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:02:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:02:41,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:02:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:02:41,643 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:02:41,644 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30 Second operand 4 states. [2018-11-18 13:02:41,694 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30. Second operand 4 states. Result 147 states and 206 transitions. Complement of second has 6 states. [2018-11-18 13:02:41,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:02:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:02:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-18 13:02:41,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 20 letters. Loop has 22 letters. [2018-11-18 13:02:41,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:02:41,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 42 letters. Loop has 22 letters. [2018-11-18 13:02:41,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:02:41,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 20 letters. Loop has 44 letters. [2018-11-18 13:02:41,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:02:41,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 206 transitions. [2018-11-18 13:02:41,702 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:02:41,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 0 states and 0 transitions. [2018-11-18 13:02:41,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:02:41,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:02:41,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:02:41,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:02:41,703 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:02:41,703 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:02:41,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:02:41,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:02:41,703 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-18 13:02:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:02:41,703 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 13:02:41,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:02:41,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 13:02:41,703 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:02:41,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 13:02:41,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:02:41,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:02:41,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:02:41,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:02:41,704 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:02:41,704 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:02:41,704 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:02:41,704 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:02:41,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:02:41,704 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:02:41,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:02:41,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:02:41 BoogieIcfgContainer [2018-11-18 13:02:41,713 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:02:41,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:02:41,714 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:02:41,714 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:02:41,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:02:34" (3/4) ... [2018-11-18 13:02:41,717 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:02:41,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:02:41,717 INFO L168 Benchmark]: Toolchain (without parser) took 7460.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.5 MB). Free memory was 959.1 MB in the beginning and 1.3 GB in the end (delta: -352.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:02:41,718 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:02:41,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 959.1 MB in the beginning and 1.2 GB in the end (delta: -208.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2018-11-18 13:02:41,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:02:41,719 INFO L168 Benchmark]: Boogie Preprocessor took 16.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:02:41,720 INFO L168 Benchmark]: RCFGBuilder took 345.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:02:41,720 INFO L168 Benchmark]: BuchiAutomizer took 6799.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -184.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-18 13:02:41,721 INFO L168 Benchmark]: Witness Printer took 3.27 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:02:41,723 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 959.1 MB in the beginning and 1.2 GB in the end (delta: -208.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 345.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6799.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -184.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.27 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 6.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 343 SDtfs, 163 SDslu, 496 SDs, 0 SdLazy, 32 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital478 mio100 ax107 hnf101 lsp26 ukn64 mio100 lsp100 div175 bol100 ite100 ukn100 eq164 hnf66 smp100 dnf4932 smp23 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 84ms VariablesStem: 0 VariablesLoop: 20 DisjunctsStem: 1 DisjunctsLoop: 16 SupportingInvariants: 0 MotzkinApplications: 32 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...