./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/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 ed765f1987456e72af41b47c4e2a2164d166c0f3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:07:43,791 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:07:43,792 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:07:43,798 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:07:43,798 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:07:43,799 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:07:43,800 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:07:43,801 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:07:43,802 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:07:43,802 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:07:43,803 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:07:43,803 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:07:43,804 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:07:43,804 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:07:43,805 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:07:43,806 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:07:43,806 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:07:43,808 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:07:43,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:07:43,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:07:43,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:07:43,812 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:07:43,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:07:43,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:07:43,814 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:07:43,814 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:07:43,815 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:07:43,815 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:07:43,816 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:07:43,817 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:07:43,817 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:07:43,817 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:07:43,818 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:07:43,818 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:07:43,818 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:07:43,819 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:07:43,819 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 13:07:43,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:07:43,830 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:07:43,831 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:07:43,831 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:07:43,832 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:07:43,832 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 13:07:43,832 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 13:07:43,832 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 13:07:43,832 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 13:07:43,832 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 13:07:43,832 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 13:07:43,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:07:43,833 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:07:43,833 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:07:43,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:07:43,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:07:43,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:07:43,833 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 13:07:43,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 13:07:43,834 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 13:07:43,834 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:07:43,834 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:07:43,834 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 13:07:43,834 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 13:07:43,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:07:43,835 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:07:43,835 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 13:07:43,835 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:07:43,835 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:07:43,835 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 13:07:43,836 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 13:07:43,836 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_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/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 -> ed765f1987456e72af41b47c4e2a2164d166c0f3 [2018-11-10 13:07:43,859 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:07:43,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:07:43,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:07:43,870 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:07:43,870 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:07:43,871 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 13:07:43,904 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/bin-2019/uautomizer/data/b0c4e6c42/bbd38b9ab9e24a74aa59db607cdfdf26/FLAGc2875e4ff [2018-11-10 13:07:44,230 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:07:44,231 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 13:07:44,239 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/bin-2019/uautomizer/data/b0c4e6c42/bbd38b9ab9e24a74aa59db607cdfdf26/FLAGc2875e4ff [2018-11-10 13:07:44,249 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/bin-2019/uautomizer/data/b0c4e6c42/bbd38b9ab9e24a74aa59db607cdfdf26 [2018-11-10 13:07:44,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:07:44,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:07:44,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:07:44,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:07:44,256 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:07:44,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:07:44" (1/1) ... [2018-11-10 13:07:44,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3976356f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:07:44, skipping insertion in model container [2018-11-10 13:07:44,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:07:44" (1/1) ... [2018-11-10 13:07:44,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:07:44,297 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:07:44,452 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:07:44,456 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:07:44,486 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:07:44,500 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:07:44,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:07:44 WrapperNode [2018-11-10 13:07:44,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:07:44,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:07:44,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:07:44,502 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:07:44,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:07:44" (1/1) ... [2018-11-10 13:07:44,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:07:44" (1/1) ... [2018-11-10 13:07:44,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:07:44,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:07:44,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:07:44,573 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:07:44,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:07:44" (1/1) ... [2018-11-10 13:07:44,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:07:44" (1/1) ... [2018-11-10 13:07:44,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:07:44" (1/1) ... [2018-11-10 13:07:44,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:07:44" (1/1) ... [2018-11-10 13:07:44,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:07:44" (1/1) ... [2018-11-10 13:07:44,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:07:44" (1/1) ... [2018-11-10 13:07:44,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:07:44" (1/1) ... [2018-11-10 13:07:44,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:07:44,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:07:44,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:07:44,597 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:07:44,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:07:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:07:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:07:44,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:07:45,059 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:07:45,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:07:45 BoogieIcfgContainer [2018-11-10 13:07:45,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:07:45,060 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 13:07:45,060 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 13:07:45,062 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 13:07:45,062 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:07:45,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:07:44" (1/3) ... [2018-11-10 13:07:45,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67b6acb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:07:45, skipping insertion in model container [2018-11-10 13:07:45,063 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:07:45,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:07:44" (2/3) ... [2018-11-10 13:07:45,064 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67b6acb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:07:45, skipping insertion in model container [2018-11-10 13:07:45,064 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:07:45,064 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:07:45" (3/3) ... [2018-11-10 13:07:45,065 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 13:07:45,095 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:07:45,096 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 13:07:45,096 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 13:07:45,096 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 13:07:45,096 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:07:45,096 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:07:45,096 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 13:07:45,096 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:07:45,096 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 13:07:45,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states. [2018-11-10 13:07:45,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2018-11-10 13:07:45,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:07:45,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:07:45,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 13:07:45,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:07:45,129 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 13:07:45,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states. [2018-11-10 13:07:45,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2018-11-10 13:07:45,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:07:45,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:07:45,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 13:07:45,134 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:07:45,139 INFO L793 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 81#L292true assume !(~r1~0 == 0);init_~tmp~0 := 0; 78#L292-1true init_#res := init_~tmp~0; 98#L421true main_#t~ret36 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 74#L490-3true [2018-11-10 13:07:45,140 INFO L795 eck$LassoCheckResult]: Loop: 74#L490-3true assume true; 69#L490-1true assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 106#L118true assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 32#L122true assume !(node1_~m1~0 != ~nomsg~0); 46#L122-1true ~mode1~0 := 0; 91#L118-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 35#L155true assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 23#L158true assume !(node2_~m2~0 != ~nomsg~0); 22#L158-1true ~mode2~0 := 0; 47#L155-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 116#L189true assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 121#L192true assume !(node3_~m3~0 != ~nomsg~0); 120#L192-1true ~mode3~0 := 0; 114#L189-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 93#L223true assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 76#L226true assume !(node4_~m4~0 != ~nomsg~0); 73#L226-1true ~mode4~0 := 0; 66#L223-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 43#L257true assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 31#L260true assume !(node5_~m5~0 != ~nomsg~0); 30#L260-1true ~mode5~0 := 0; 42#L257-2true assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 102#L429true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 103#L429-1true check_#res := check_~tmp~1; 49#L441true main_#t~ret37 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 95#L520true assume !(assert_~arg % 256 == 0); 64#L515true assume { :end_inline_assert } true;main_#t~post38 := main_~i2~0;main_~i2~0 := main_#t~post38 + 1;havoc main_#t~post38; 74#L490-3true [2018-11-10 13:07:45,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:07:45,145 INFO L82 PathProgramCache]: Analyzing trace with hash 28880448, now seen corresponding path program 1 times [2018-11-10 13:07:45,147 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:07:45,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:07:45,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:07:45,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:07:45,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:07:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:07:45,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:07:45,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:07:45,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:07:45,284 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 13:07:45,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:07:45,284 INFO L82 PathProgramCache]: Analyzing trace with hash 199422581, now seen corresponding path program 1 times [2018-11-10 13:07:45,284 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:07:45,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:07:45,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:07:45,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:07:45,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:07:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:07:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:07:45,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:07:45,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:07:45,359 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:07:45,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:07:45,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:07:45,370 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 4 states. [2018-11-10 13:07:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:07:45,432 INFO L93 Difference]: Finished difference Result 122 states and 201 transitions. [2018-11-10 13:07:45,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:07:45,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 201 transitions. [2018-11-10 13:07:45,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-10 13:07:45,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 115 states and 163 transitions. [2018-11-10 13:07:45,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2018-11-10 13:07:45,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2018-11-10 13:07:45,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 163 transitions. [2018-11-10 13:07:45,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:07:45,441 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 163 transitions. [2018-11-10 13:07:45,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 163 transitions. [2018-11-10 13:07:45,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-10 13:07:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 13:07:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2018-11-10 13:07:45,466 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 163 transitions. [2018-11-10 13:07:45,466 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 163 transitions. [2018-11-10 13:07:45,466 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 13:07:45,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 163 transitions. [2018-11-10 13:07:45,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-10 13:07:45,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:07:45,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:07:45,469 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:07:45,469 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:07:45,469 INFO L793 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 276#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 277#L292 assume ~r1~0 == 0; 289#L293 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 290#L294 assume ~id1~0 >= 0; 339#L295 assume ~st1~0 == 0; 272#L296 assume ~send1~0 == ~id1~0; 273#L297 assume ~mode1~0 % 256 == 0; 342#L298 assume ~id2~0 >= 0; 284#L299 assume ~st2~0 == 0; 285#L300 assume ~send2~0 == ~id2~0; 328#L301 assume ~mode2~0 % 256 == 0; 329#L302 assume ~id3~0 >= 0; 347#L303 assume ~st3~0 == 0; 300#L304 assume ~send3~0 == ~id3~0; 301#L305 assume ~mode3~0 % 256 == 0; 344#L306 assume ~id4~0 >= 0; 282#L307 assume ~st4~0 == 0; 283#L308 assume ~send4~0 == ~id4~0; 341#L309 assume ~mode4~0 % 256 == 0; 270#L310 assume ~id5~0 >= 0; 271#L311 assume ~st5~0 == 0; 316#L312 assume ~send5~0 == ~id5~0; 317#L313 assume ~mode5~0 % 256 == 0; 360#L314 assume ~id1~0 != ~id2~0; 298#L315 assume ~id1~0 != ~id3~0; 299#L316 assume ~id1~0 != ~id4~0; 343#L317 assume ~id1~0 != ~id5~0; 278#L318 assume ~id2~0 != ~id3~0; 279#L319 assume ~id2~0 != ~id4~0; 340#L320 assume ~id2~0 != ~id5~0; 265#L321 assume ~id3~0 != ~id4~0; 266#L322 assume ~id3~0 != ~id5~0; 312#L323 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 313#L292-1 init_#res := init_~tmp~0; 359#L421 main_#t~ret36 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 349#L490-3 [2018-11-10 13:07:45,469 INFO L795 eck$LassoCheckResult]: Loop: 349#L490-3 assume true; 353#L490-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 354#L118 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 309#L122 assume !(node1_~m1~0 != ~nomsg~0); 311#L122-1 ~mode1~0 := 0; 330#L118-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 318#L155 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 292#L158 assume !(node2_~m2~0 != ~nomsg~0); 291#L158-1 ~mode2~0 := 0; 287#L155-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 331#L189 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 371#L192 assume !(node3_~m3~0 != ~nomsg~0); 263#L192-1 ~mode3~0 := 0; 361#L189-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 366#L223 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 358#L226 assume !(node4_~m4~0 != ~nomsg~0); 303#L226-1 ~mode4~0 := 0; 319#L223-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 325#L257 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 307#L260 assume !(node5_~m5~0 != ~nomsg~0); 305#L260-1 ~mode5~0 := 0; 306#L257-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 324#L429 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 327#L429-1 check_#res := check_~tmp~1; 334#L441 main_#t~ret37 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 335#L520 assume !(assert_~arg % 256 == 0); 348#L515 assume { :end_inline_assert } true;main_#t~post38 := main_~i2~0;main_~i2~0 := main_#t~post38 + 1;havoc main_#t~post38; 349#L490-3 [2018-11-10 13:07:45,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:07:45,470 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 1 times [2018-11-10 13:07:45,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:07:45,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:07:45,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:07:45,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:07:45,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:07:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:07:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:07:45,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:07:45,543 INFO L82 PathProgramCache]: Analyzing trace with hash 199422581, now seen corresponding path program 2 times [2018-11-10 13:07:45,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:07:45,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:07:45,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:07:45,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:07:45,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:07:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:07:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:07:45,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:07:45,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:07:45,600 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:07:45,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:07:45,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:07:45,601 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. cyclomatic complexity: 49 Second operand 5 states. [2018-11-10 13:07:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:07:45,633 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2018-11-10 13:07:45,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:07:45,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 165 transitions. [2018-11-10 13:07:45,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-10 13:07:45,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 115 states and 161 transitions. [2018-11-10 13:07:45,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2018-11-10 13:07:45,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2018-11-10 13:07:45,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 161 transitions. [2018-11-10 13:07:45,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:07:45,638 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 161 transitions. [2018-11-10 13:07:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 161 transitions. [2018-11-10 13:07:45,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-10 13:07:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 13:07:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2018-11-10 13:07:45,642 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 161 transitions. [2018-11-10 13:07:45,642 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 161 transitions. [2018-11-10 13:07:45,642 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 13:07:45,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 161 transitions. [2018-11-10 13:07:45,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-10 13:07:45,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:07:45,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:07:45,645 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:07:45,645 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:07:45,645 INFO L793 eck$LassoCheckResult]: Stem: 612#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 521#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 522#L292 assume ~r1~0 == 0; 534#L293 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 535#L294 assume ~id1~0 >= 0; 584#L295 assume ~st1~0 == 0; 517#L296 assume ~send1~0 == ~id1~0; 518#L297 assume ~mode1~0 % 256 == 0; 587#L298 assume ~id2~0 >= 0; 529#L299 assume ~st2~0 == 0; 530#L300 assume ~send2~0 == ~id2~0; 573#L301 assume ~mode2~0 % 256 == 0; 574#L302 assume ~id3~0 >= 0; 592#L303 assume ~st3~0 == 0; 545#L304 assume ~send3~0 == ~id3~0; 546#L305 assume ~mode3~0 % 256 == 0; 589#L306 assume ~id4~0 >= 0; 527#L307 assume ~st4~0 == 0; 528#L308 assume ~send4~0 == ~id4~0; 586#L309 assume ~mode4~0 % 256 == 0; 515#L310 assume ~id5~0 >= 0; 516#L311 assume ~st5~0 == 0; 561#L312 assume ~send5~0 == ~id5~0; 562#L313 assume ~mode5~0 % 256 == 0; 605#L314 assume ~id1~0 != ~id2~0; 543#L315 assume ~id1~0 != ~id3~0; 544#L316 assume ~id1~0 != ~id4~0; 588#L317 assume ~id1~0 != ~id5~0; 523#L318 assume ~id2~0 != ~id3~0; 524#L319 assume ~id2~0 != ~id4~0; 585#L320 assume ~id2~0 != ~id5~0; 510#L321 assume ~id3~0 != ~id4~0; 511#L322 assume ~id3~0 != ~id5~0; 557#L323 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 558#L292-1 init_#res := init_~tmp~0; 604#L421 main_#t~ret36 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 594#L490-3 [2018-11-10 13:07:45,645 INFO L795 eck$LassoCheckResult]: Loop: 594#L490-3 assume true; 598#L490-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 599#L118 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 554#L122 assume !(node1_~m1~0 != ~nomsg~0); 556#L122-1 ~mode1~0 := 0; 575#L118-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 563#L155 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 537#L158 assume !(node2_~m2~0 != ~nomsg~0); 536#L158-1 ~mode2~0 := 0; 532#L155-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 576#L189 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 616#L192 assume !(node3_~m3~0 != ~nomsg~0); 508#L192-1 ~mode3~0 := 0; 606#L189-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 611#L223 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 603#L226 assume !(node4_~m4~0 != ~nomsg~0); 548#L226-1 ~mode4~0 := 0; 564#L223-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 570#L257 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 552#L260 assume !(node5_~m5~0 != ~nomsg~0); 550#L260-1 ~mode5~0 := 0; 551#L257-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 569#L429 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 581#L430 assume ~r1~0 < 5;check_~tmp~1 := 1; 572#L429-1 check_#res := check_~tmp~1; 579#L441 main_#t~ret37 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 580#L520 assume !(assert_~arg % 256 == 0); 593#L515 assume { :end_inline_assert } true;main_#t~post38 := main_~i2~0;main_~i2~0 := main_#t~post38 + 1;havoc main_#t~post38; 594#L490-3 [2018-11-10 13:07:45,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:07:45,645 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 2 times [2018-11-10 13:07:45,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:07:45,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:07:45,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:07:45,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:07:45,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:07:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:07:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:07:45,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:07:45,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1503805655, now seen corresponding path program 1 times [2018-11-10 13:07:45,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:07:45,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:07:45,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:07:45,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:07:45,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:07:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:07:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:07:45,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:07:45,705 INFO L82 PathProgramCache]: Analyzing trace with hash 500261995, now seen corresponding path program 1 times [2018-11-10 13:07:45,705 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:07:45,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:07:45,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:07:45,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:07:45,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:07:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:07:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:07:45,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:07:45,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:07:46,094 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 137 [2018-11-10 13:07:46,586 WARN L179 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 118 [2018-11-10 13:07:46,599 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:07:46,600 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:07:46,600 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:07:46,600 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:07:46,600 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 13:07:46,600 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:07:46,600 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:07:46,600 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:07:46,601 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration3_Loop [2018-11-10 13:07:46,601 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:07:46,601 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:07:46,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,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-10 13:07:46,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,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-10 13:07:46,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:46,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,118 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:07:47,119 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:07:47,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:07:47,126 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_218cf4dc-e0ef-45f5-bf0c-ac0f0bd715c8/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:07:47,150 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:07:47,150 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:07:47,254 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 13:07:47,255 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:07:47,256 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:07:47,256 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:07:47,256 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:07:47,256 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:07:47,256 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:07:47,256 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:07:47,256 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:07:47,256 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration3_Loop [2018-11-10 13:07:47,256 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:07:47,256 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:07:47,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:07:47,744 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:07:47,748 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:07:47,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:07:47,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:07:47,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:07:47,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:07:47,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:07:47,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:07:47,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:07:47,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:07:47,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:07:47,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:07:47,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:07:47,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:07:47,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:07:47,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:07:47,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:07:47,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:07:47,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:07:47,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:07:47,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:07:47,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:07:47,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:07:47,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:07:47,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:07:47,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:07:47,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:07:47,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:07:47,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:07:47,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:07:47,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:07:47,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:07:47,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:07:47,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:07:47,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:07:47,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:07:47,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:07:47,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:07:47,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:07:47,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:07:47,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:07:47,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:07:47,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:07:47,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:07:47,772 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:07:47,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:07:47,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:07:47,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:07:47,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:07:47,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:07:47,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:07:47,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:07:47,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:07:47,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:07:47,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:07:47,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:07:47,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:07:47,777 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:07:47,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:07:47,778 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:07:47,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:07:47,781 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:07:47,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:07:47,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:07:47,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:07:47,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:07:47,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:07:47,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:07:47,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:07:47,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:07:47,784 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:07:47,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:07:47,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:07:47,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:07:47,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:07:47,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:07:47,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:07:47,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:07:47,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:07:47,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:07:47,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:07:47,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:07:47,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:07:47,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:07:47,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:07:47,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:07:47,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:07:47,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:07:47,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:07:47,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:07:47,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:07:47,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:07:47,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:07:47,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:07:47,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:07:47,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:07:47,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:07:47,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:07:47,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:07:47,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:07:47,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:07:47,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:07:47,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:07:47,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:07:47,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:07:47,799 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:07:47,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:07:47,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:07:47,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:07:47,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:07:47,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:07:47,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:07:47,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:07:47,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:07:47,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:07:47,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:07:47,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:07:47,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:07:47,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:07:47,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:07:47,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:07:47,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:07:47,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:07:47,804 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:07:47,807 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 13:07:47,807 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 13:07:47,808 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:07:47,809 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 13:07:47,809 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:07:47,809 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2018-11-10 13:07:47,810 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 13:07:47,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:07:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:07:47,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:07:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:07:47,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:07:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:07:47,904 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 13:07:47,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 161 transitions. cyclomatic complexity: 47 Second operand 4 states. [2018-11-10 13:07:47,943 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 161 transitions. cyclomatic complexity: 47. Second operand 4 states. Result 194 states and 287 transitions. Complement of second has 6 states. [2018-11-10 13:07:47,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 13:07:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 13:07:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2018-11-10 13:07:47,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 161 transitions. Stem has 36 letters. Loop has 28 letters. [2018-11-10 13:07:47,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:07:47,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 161 transitions. Stem has 64 letters. Loop has 28 letters. [2018-11-10 13:07:47,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:07:47,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 161 transitions. Stem has 36 letters. Loop has 56 letters. [2018-11-10 13:07:47,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:07:47,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 287 transitions. [2018-11-10 13:07:47,949 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:07:47,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 0 states and 0 transitions. [2018-11-10 13:07:47,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:07:47,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:07:47,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:07:47,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:07:47,950 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:07:47,950 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:07:47,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:07:47,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:07:47,950 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 13:07:47,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:07:47,950 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 13:07:47,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:07:47,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 13:07:47,950 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:07:47,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:07:47,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:07:47,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:07:47,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:07:47,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:07:47,951 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:07:47,951 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:07:47,951 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:07:47,951 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 13:07:47,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:07:47,951 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:07:47,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 13:07:47,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:07:47 BoogieIcfgContainer [2018-11-10 13:07:47,955 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 13:07:47,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:07:47,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:07:47,955 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:07:47,955 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:07:45" (3/4) ... [2018-11-10 13:07:47,957 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:07:47,958 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:07:47,958 INFO L168 Benchmark]: Toolchain (without parser) took 3705.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.9 MB). Free memory was 953.8 MB in the beginning and 1.2 GB in the end (delta: -288.2 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:07:47,959 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:07:47,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.52 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 934.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:07:47,959 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 934.9 MB in the beginning and 1.2 GB in the end (delta: -236.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:07:47,960 INFO L168 Benchmark]: Boogie Preprocessor took 23.42 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-10 13:07:47,960 INFO L168 Benchmark]: RCFGBuilder took 463.14 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: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2018-11-10 13:07:47,961 INFO L168 Benchmark]: BuchiAutomizer took 2895.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -119.5 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:07:47,961 INFO L168 Benchmark]: Witness Printer took 2.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:07:47,964 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 247.52 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 934.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 934.9 MB in the beginning and 1.2 GB in the end (delta: -236.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.42 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 463.14 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: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2895.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -119.5 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 115 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 519 SDtfs, 285 SDslu, 963 SDs, 0 SdLazy, 22 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital303 mio100 ax120 hnf105 lsp16 ukn100 mio100 lsp100 div106 bol100 ite100 ukn100 eq215 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...