./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.2.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_5555c645-ec92-417a-ad37-88a49f8899c3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5555c645-ec92-417a-ad37-88a49f8899c3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5555c645-ec92-417a-ad37-88a49f8899c3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5555c645-ec92-417a-ad37-88a49f8899c3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5555c645-ec92-417a-ad37-88a49f8899c3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5555c645-ec92-417a-ad37-88a49f8899c3/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 c13792dac8774c9ebb29902c2dbd93ae05dc00b8 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:11:59,933 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:59,935 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:59,943 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:59,944 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:59,944 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:59,945 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:59,946 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:59,948 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:59,949 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:59,949 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:59,950 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:59,951 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:59,951 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:59,952 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:59,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:59,953 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:59,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:59,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:59,957 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:59,958 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:59,959 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:59,961 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:59,961 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:59,961 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:59,962 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:59,963 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:59,963 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:59,964 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:59,965 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:59,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:59,965 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:59,965 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:59,966 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:59,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:59,967 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:59,967 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5555c645-ec92-417a-ad37-88a49f8899c3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:11:59,979 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:59,979 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:59,980 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:11:59,980 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:11:59,980 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:11:59,980 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:11:59,981 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:11:59,981 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:11:59,981 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:11:59,981 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:11:59,981 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:11:59,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:59,982 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:11:59,982 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:11:59,983 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:59,983 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:11:59,983 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:59,983 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:11:59,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:11:59,983 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:11:59,983 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:11:59,983 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:59,984 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:11:59,984 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:11:59,984 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:59,984 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:59,984 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:11:59,984 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:59,984 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:11:59,985 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:11:59,985 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:11:59,985 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_5555c645-ec92-417a-ad37-88a49f8899c3/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 -> c13792dac8774c9ebb29902c2dbd93ae05dc00b8 [2018-10-27 06:12:00,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:12:00,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:12:00,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:12:00,025 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:12:00,025 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:12:00,025 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5555c645-ec92-417a-ad37-88a49f8899c3/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c [2018-10-27 06:12:00,068 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5555c645-ec92-417a-ad37-88a49f8899c3/bin-2019/uautomizer/data/5d5262fe7/578bdcf5970a412fae79981d500ca8d0/FLAG055b8971b [2018-10-27 06:12:00,439 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:12:00,440 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5555c645-ec92-417a-ad37-88a49f8899c3/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c [2018-10-27 06:12:00,449 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5555c645-ec92-417a-ad37-88a49f8899c3/bin-2019/uautomizer/data/5d5262fe7/578bdcf5970a412fae79981d500ca8d0/FLAG055b8971b [2018-10-27 06:12:00,460 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5555c645-ec92-417a-ad37-88a49f8899c3/bin-2019/uautomizer/data/5d5262fe7/578bdcf5970a412fae79981d500ca8d0 [2018-10-27 06:12:00,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:12:00,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:12:00,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:00,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:12:00,468 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:12:00,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:00" (1/1) ... [2018-10-27 06:12:00,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e4eb0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:00, skipping insertion in model container [2018-10-27 06:12:00,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:00" (1/1) ... [2018-10-27 06:12:00,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:12:00,511 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:12:00,690 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:00,694 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:12:00,742 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:00,756 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:12:00,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:00 WrapperNode [2018-10-27 06:12:00,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:00,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:00,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:12:00,758 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:12:00,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:00" (1/1) ... [2018-10-27 06:12:00,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:00" (1/1) ... [2018-10-27 06:12:00,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:00,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:12:00,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:12:00,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:12:00,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:00" (1/1) ... [2018-10-27 06:12:00,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:00" (1/1) ... [2018-10-27 06:12:00,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:00" (1/1) ... [2018-10-27 06:12:00,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:00" (1/1) ... [2018-10-27 06:12:00,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:00" (1/1) ... [2018-10-27 06:12:00,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:00" (1/1) ... [2018-10-27 06:12:00,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:00" (1/1) ... [2018-10-27 06:12:00,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:12:00,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:12:00,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:12:00,910 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:12:00,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5555c645-ec92-417a-ad37-88a49f8899c3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:12:00,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:12:02,035 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:12:02,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:02 BoogieIcfgContainer [2018-10-27 06:12:02,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:12:02,037 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:12:02,037 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:12:02,040 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:12:02,040 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:02,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:12:00" (1/3) ... [2018-10-27 06:12:02,041 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62b1df4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:02, skipping insertion in model container [2018-10-27 06:12:02,042 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:02,042 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:00" (2/3) ... [2018-10-27 06:12:02,042 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62b1df4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:02, skipping insertion in model container [2018-10-27 06:12:02,042 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:02,042 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:02" (3/3) ... [2018-10-27 06:12:02,044 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c [2018-10-27 06:12:02,084 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:12:02,084 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:12:02,085 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:12:02,085 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:12:02,085 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:12:02,085 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:12:02,085 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:12:02,085 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:12:02,085 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:12:02,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states. [2018-10-27 06:12:02,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2018-10-27 06:12:02,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:02,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:02,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:12:02,126 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-10-27 06:12:02,126 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:12:02,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states. [2018-10-27 06:12:02,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2018-10-27 06:12:02,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:02,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:02,132 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:12:02,132 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-10-27 06:12:02,138 INFO L793 eck$LassoCheckResult]: Stem: 89#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]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 56#L287true assume !(~r1~0 == 0);init_~tmp~0 := 0; 39#L287-1true init_#res := init_~tmp~0; 66#L416true main_#t~ret35 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;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; 50#L485-3true [2018-10-27 06:12:02,139 INFO L795 eck$LassoCheckResult]: Loop: 50#L485-3true assume true; 47#L485-1true assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 99#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; 33#L122true assume !(node1_~m1~0 != ~nomsg~0); 46#L122-1true ~mode1~0 := 0; 86#L118-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 26#L150true assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 16#L153true assume !(node2_~m2~0 != ~nomsg~0); 15#L153-1true ~mode2~0 := 0; 7#L150-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 104#L184true assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 83#L187true assume !(node3_~m3~0 != ~nomsg~0); 82#L187-1true ~mode3~0 := 0; 100#L184-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 49#L218true assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 38#L221true assume !(node4_~m4~0 != ~nomsg~0); 37#L221-1true ~mode4~0 := 0; 60#L218-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 4#L252true assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 9#L255true assume !(node5_~m5~0 != ~nomsg~0); 112#L255-1true ~mode5~0 := 0; 3#L252-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; 71#L424true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 74#L424-1true check_#res := check_~tmp~1; 23#L436true main_#t~ret36 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;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; 62#L515true assume !(assert_~arg % 256 == 0); 41#L510true assume { :end_inline_assert } true;main_#t~post37 := main_~i2~0;main_~i2~0 := main_#t~post37 + 1;havoc main_#t~post37; 50#L485-3true [2018-10-27 06:12:02,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:02,146 INFO L82 PathProgramCache]: Analyzing trace with hash 28880448, now seen corresponding path program 1 times [2018-10-27 06:12:02,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:02,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:02,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:02,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:02,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:02,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:02,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:02,307 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:12:02,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:02,307 INFO L82 PathProgramCache]: Analyzing trace with hash -298483211, now seen corresponding path program 1 times [2018-10-27 06:12:02,307 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:02,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:02,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:02,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:02,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:02,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:02,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:12:02,458 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:02,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:12:02,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:12:02,473 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 4 states. [2018-10-27 06:12:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:02,655 INFO L93 Difference]: Finished difference Result 119 states and 196 transitions. [2018-10-27 06:12:02,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:12:02,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 196 transitions. [2018-10-27 06:12:02,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2018-10-27 06:12:02,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 112 states and 158 transitions. [2018-10-27 06:12:02,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2018-10-27 06:12:02,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2018-10-27 06:12:02,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 158 transitions. [2018-10-27 06:12:02,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:02,672 INFO L705 BuchiCegarLoop]: Abstraction has 112 states and 158 transitions. [2018-10-27 06:12:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 158 transitions. [2018-10-27 06:12:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-10-27 06:12:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-27 06:12:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2018-10-27 06:12:02,702 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 158 transitions. [2018-10-27 06:12:02,702 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 158 transitions. [2018-10-27 06:12:02,702 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:12:02,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 158 transitions. [2018-10-27 06:12:02,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2018-10-27 06:12:02,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:02,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:02,706 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-10-27 06:12:02,706 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-10-27 06:12:02,706 INFO L793 eck$LassoCheckResult]: Stem: 356#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]; 262#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 263#L287 assume ~r1~0 == 0; 268#L288 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 269#L289 assume ~id1~0 >= 0; 323#L290 assume ~st1~0 == 0; 324#L291 assume ~send1~0 == ~id1~0; 353#L292 assume ~mode1~0 % 256 == 0; 277#L293 assume ~id2~0 >= 0; 278#L294 assume ~st2~0 == 0; 333#L295 assume ~send2~0 == ~id2~0; 258#L296 assume ~mode2~0 % 256 == 0; 259#L297 assume ~id3~0 >= 0; 337#L298 assume ~st3~0 == 0; 272#L299 assume ~send3~0 == ~id3~0; 273#L300 assume ~mode3~0 % 256 == 0; 325#L301 assume ~id4~0 >= 0; 326#L302 assume ~st4~0 == 0; 340#L303 assume ~send4~0 == ~id4~0; 299#L304 assume ~mode4~0 % 256 == 0; 300#L305 assume ~id5~0 >= 0; 339#L306 assume ~st5~0 == 0; 270#L307 assume ~send5~0 == ~id5~0; 271#L308 assume ~mode5~0 % 256 == 0; 334#L309 assume ~id1~0 != ~id2~0; 256#L310 assume ~id1~0 != ~id3~0; 257#L311 assume ~id1~0 != ~id4~0; 307#L312 assume ~id1~0 != ~id5~0; 308#L313 assume ~id2~0 != ~id3~0; 352#L314 assume ~id2~0 != ~id4~0; 297#L315 assume ~id2~0 != ~id5~0; 298#L316 assume ~id3~0 != ~id4~0; 338#L317 assume ~id3~0 != ~id5~0; 266#L318 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 267#L287-1 init_#res := init_~tmp~0; 316#L416 main_#t~ret35 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;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; 319#L485-3 [2018-10-27 06:12:02,706 INFO L795 eck$LassoCheckResult]: Loop: 319#L485-3 assume true; 327#L485-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 328#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; 304#L122 assume !(node1_~m1~0 != ~nomsg~0); 306#L122-1 ~mode1~0 := 0; 280#L118-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 292#L150 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 275#L153 assume !(node2_~m2~0 != ~nomsg~0); 274#L153-1 ~mode2~0 := 0; 260#L150-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 261#L184 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 354#L187 assume !(node3_~m3~0 != ~nomsg~0); 312#L187-1 ~mode3~0 := 0; 347#L184-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 331#L218 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 314#L221 assume !(node4_~m4~0 != ~nomsg~0); 313#L221-1 ~mode4~0 := 0; 295#L218-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 253#L252 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 255#L255 assume !(node5_~m5~0 != ~nomsg~0); 265#L255-1 ~mode5~0 := 0; 251#L252-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; 252#L424 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 282#L424-1 check_#res := check_~tmp~1; 288#L436 main_#t~ret36 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;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; 289#L515 assume !(assert_~arg % 256 == 0); 318#L510 assume { :end_inline_assert } true;main_#t~post37 := main_~i2~0;main_~i2~0 := main_#t~post37 + 1;havoc main_#t~post37; 319#L485-3 [2018-10-27 06:12:02,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:02,707 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 1 times [2018-10-27 06:12:02,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:02,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:02,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:02,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:02,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:02,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:02,810 INFO L82 PathProgramCache]: Analyzing trace with hash -298483211, now seen corresponding path program 2 times [2018-10-27 06:12:02,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:02,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:02,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:02,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:02,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:02,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:02,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:12:02,929 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:02,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:12:02,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:12:02,930 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. cyclomatic complexity: 47 Second operand 5 states. [2018-10-27 06:12:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:03,084 INFO L93 Difference]: Finished difference Result 115 states and 160 transitions. [2018-10-27 06:12:03,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:12:03,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 160 transitions. [2018-10-27 06:12:03,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2018-10-27 06:12:03,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 112 states and 156 transitions. [2018-10-27 06:12:03,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2018-10-27 06:12:03,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2018-10-27 06:12:03,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 156 transitions. [2018-10-27 06:12:03,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:03,090 INFO L705 BuchiCegarLoop]: Abstraction has 112 states and 156 transitions. [2018-10-27 06:12:03,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 156 transitions. [2018-10-27 06:12:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-10-27 06:12:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-27 06:12:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2018-10-27 06:12:03,096 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 156 transitions. [2018-10-27 06:12:03,096 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 156 transitions. [2018-10-27 06:12:03,096 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:12:03,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 156 transitions. [2018-10-27 06:12:03,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2018-10-27 06:12:03,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:03,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:03,099 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-10-27 06:12:03,099 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-10-27 06:12:03,100 INFO L793 eck$LassoCheckResult]: Stem: 595#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]; 501#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 502#L287 assume ~r1~0 == 0; 507#L288 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 508#L289 assume ~id1~0 >= 0; 562#L290 assume ~st1~0 == 0; 563#L291 assume ~send1~0 == ~id1~0; 592#L292 assume ~mode1~0 % 256 == 0; 516#L293 assume ~id2~0 >= 0; 517#L294 assume ~st2~0 == 0; 572#L295 assume ~send2~0 == ~id2~0; 497#L296 assume ~mode2~0 % 256 == 0; 498#L297 assume ~id3~0 >= 0; 576#L298 assume ~st3~0 == 0; 511#L299 assume ~send3~0 == ~id3~0; 512#L300 assume ~mode3~0 % 256 == 0; 564#L301 assume ~id4~0 >= 0; 565#L302 assume ~st4~0 == 0; 579#L303 assume ~send4~0 == ~id4~0; 538#L304 assume ~mode4~0 % 256 == 0; 539#L305 assume ~id5~0 >= 0; 578#L306 assume ~st5~0 == 0; 509#L307 assume ~send5~0 == ~id5~0; 510#L308 assume ~mode5~0 % 256 == 0; 573#L309 assume ~id1~0 != ~id2~0; 495#L310 assume ~id1~0 != ~id3~0; 496#L311 assume ~id1~0 != ~id4~0; 546#L312 assume ~id1~0 != ~id5~0; 547#L313 assume ~id2~0 != ~id3~0; 591#L314 assume ~id2~0 != ~id4~0; 536#L315 assume ~id2~0 != ~id5~0; 537#L316 assume ~id3~0 != ~id4~0; 577#L317 assume ~id3~0 != ~id5~0; 505#L318 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 506#L287-1 init_#res := init_~tmp~0; 555#L416 main_#t~ret35 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;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; 558#L485-3 [2018-10-27 06:12:03,100 INFO L795 eck$LassoCheckResult]: Loop: 558#L485-3 assume true; 566#L485-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 567#L118 assume !(~mode1~0 % 256 != 0); 522#L136 assume !(~alive1~0 % 256 != 0); 518#L136-2 ~mode1~0 := 1; 519#L118-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 531#L150 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 514#L153 assume !(node2_~m2~0 != ~nomsg~0); 513#L153-1 ~mode2~0 := 0; 499#L150-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 500#L184 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 593#L187 assume !(node3_~m3~0 != ~nomsg~0); 551#L187-1 ~mode3~0 := 0; 586#L184-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 570#L218 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 553#L221 assume !(node4_~m4~0 != ~nomsg~0); 552#L221-1 ~mode4~0 := 0; 534#L218-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 492#L252 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 494#L255 assume !(node5_~m5~0 != ~nomsg~0); 504#L255-1 ~mode5~0 := 0; 490#L252-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; 491#L424 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 529#L425 assume ~r1~0 < 5;check_~tmp~1 := 1; 521#L424-1 check_#res := check_~tmp~1; 527#L436 main_#t~ret36 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;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; 528#L515 assume !(assert_~arg % 256 == 0); 557#L510 assume { :end_inline_assert } true;main_#t~post37 := main_~i2~0;main_~i2~0 := main_#t~post37 + 1;havoc main_#t~post37; 558#L485-3 [2018-10-27 06:12:03,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:03,100 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 2 times [2018-10-27 06:12:03,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:03,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:03,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:03,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:03,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:03,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:03,153 INFO L82 PathProgramCache]: Analyzing trace with hash -187576207, now seen corresponding path program 1 times [2018-10-27 06:12:03,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:03,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:03,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:03,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:03,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1191119867, now seen corresponding path program 1 times [2018-10-27 06:12:03,183 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:03,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:03,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:03,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:03,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:03,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:03,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:04,170 WARN L179 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 124 [2018-10-27 06:12:04,780 WARN L179 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 106 [2018-10-27 06:12:04,809 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:04,810 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:04,810 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:04,811 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:04,811 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:12:04,811 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:04,812 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:04,812 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:04,812 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration3_Loop [2018-10-27 06:12:04,812 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:04,813 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:04,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:04,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,370 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-27 06:12:05,714 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-27 06:12:05,755 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:05,756 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5555c645-ec92-417a-ad37-88a49f8899c3/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:05,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:12:05,763 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5555c645-ec92-417a-ad37-88a49f8899c3/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:05,787 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:12:05,788 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:12:05,933 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:12:05,935 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:05,935 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:05,935 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:05,935 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:05,935 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:05,935 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:05,935 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:05,936 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:05,936 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5_false-unreach-call.2.ufo.BOUNDED-10.pals_true-termination.c_Iteration3_Loop [2018-10-27 06:12:05,936 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:05,936 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:05,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:05,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,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-10-27 06:12:06,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,507 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 06:12:06,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:06,756 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-10-27 06:12:07,253 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-27 06:12:07,291 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:07,297 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:07,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:07,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:07,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:07,312 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:07,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:07,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:07,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:07,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:07,327 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:07,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:07,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:07,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:07,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:07,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:07,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:07,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:07,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:07,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:07,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:07,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:07,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:07,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:07,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:07,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:07,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:07,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:07,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:07,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:07,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:07,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:07,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:07,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:07,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:07,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:07,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:07,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:07,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:07,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:07,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:07,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:07,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:07,403 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:07,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:07,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:07,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:07,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:07,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:07,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:07,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:07,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:07,412 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:07,415 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:12:07,415 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:12:07,421 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:07,421 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:12:07,421 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:07,422 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-10-27 06:12:07,423 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:12:07,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:07,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:07,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:07,618 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:12:07,619 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 156 transitions. cyclomatic complexity: 45 Second operand 4 states. [2018-10-27 06:12:07,680 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 156 transitions. cyclomatic complexity: 45. Second operand 4 states. Result 188 states and 277 transitions. Complement of second has 6 states. [2018-10-27 06:12:07,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:12:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2018-10-27 06:12:07,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 156 transitions. Stem has 36 letters. Loop has 28 letters. [2018-10-27 06:12:07,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:07,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 156 transitions. Stem has 64 letters. Loop has 28 letters. [2018-10-27 06:12:07,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:07,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 156 transitions. Stem has 36 letters. Loop has 56 letters. [2018-10-27 06:12:07,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:07,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 277 transitions. [2018-10-27 06:12:07,690 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:07,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 0 states and 0 transitions. [2018-10-27 06:12:07,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:12:07,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:12:07,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:12:07,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:07,693 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:07,693 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:07,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:07,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:07,694 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-10-27 06:12:07,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:07,694 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-10-27 06:12:07,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:12:07,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-10-27 06:12:07,694 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:07,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 06:12:07,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:12:07,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:12:07,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:12:07,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:07,695 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:07,695 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:07,695 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:07,695 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:12:07,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:12:07,695 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:07,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:12:07,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:12:07 BoogieIcfgContainer [2018-10-27 06:12:07,701 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:12:07,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:12:07,702 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:12:07,702 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:12:07,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:02" (3/4) ... [2018-10-27 06:12:07,706 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:12:07,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:12:07,708 INFO L168 Benchmark]: Toolchain (without parser) took 7245.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 960.7 MB in the beginning and 924.5 MB in the end (delta: 36.3 MB). Peak memory consumption was 242.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:07,709 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:07,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.87 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 941.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:07,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.27 ms. Allocated memory is still 1.0 GB. Free memory was 941.8 MB in the beginning and 939.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:07,710 INFO L168 Benchmark]: Boogie Preprocessor took 86.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:07,712 INFO L168 Benchmark]: RCFGBuilder took 1126.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:07,713 INFO L168 Benchmark]: BuchiAutomizer took 5664.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 924.5 MB in the end (delta: 150.6 MB). Peak memory consumption was 226.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:07,713 INFO L168 Benchmark]: Witness Printer took 5.03 ms. Allocated memory is still 1.2 GB. Free memory is still 924.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:07,716 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 292.87 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 941.8 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 65.27 ms. Allocated memory is still 1.0 GB. Free memory was 941.8 MB in the beginning and 939.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1126.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5664.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 924.5 MB in the end (delta: 150.6 MB). Peak memory consumption was 226.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.03 ms. Allocated memory is still 1.2 GB. Free memory is still 924.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. 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 112 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 504 SDtfs, 275 SDslu, 933 SDs, 0 SdLazy, 22 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax142 hnf109 lsp26 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq228 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...