./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/chunk2_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_46f32a55-a887-466b-ba7f-e58115f37acd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_46f32a55-a887-466b-ba7f-e58115f37acd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_46f32a55-a887-466b-ba7f-e58115f37acd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_46f32a55-a887-466b-ba7f-e58115f37acd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/chunk2_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_46f32a55-a887-466b-ba7f-e58115f37acd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_46f32a55-a887-466b-ba7f-e58115f37acd/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 64bit --witnessprinter.graph.data.programhash 7ec9a57be1d36dda380e5a4e58b869e7f4707b06 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:34:52,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:34:52,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:34:52,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:34:52,306 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:34:52,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:34:52,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:34:52,308 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:34:52,309 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:34:52,310 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:34:52,310 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:34:52,310 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:34:52,311 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:34:52,312 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:34:52,312 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:34:52,313 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:34:52,314 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:34:52,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:34:52,316 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:34:52,317 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:34:52,317 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:34:52,318 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:34:52,319 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:34:52,320 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:34:52,320 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:34:52,320 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:34:52,321 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:34:52,321 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:34:52,322 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:34:52,323 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:34:52,323 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:34:52,323 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:34:52,324 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:34:52,324 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:34:52,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:34:52,325 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:34:52,325 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_46f32a55-a887-466b-ba7f-e58115f37acd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 11:34:52,334 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:34:52,335 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:34:52,335 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:34:52,336 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:34:52,336 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:34:52,336 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:34:52,336 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:34:52,336 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:34:52,336 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:34:52,336 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:34:52,336 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:34:52,337 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:34:52,337 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:34:52,337 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:34:52,337 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:34:52,337 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:34:52,337 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:34:52,337 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:34:52,338 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:34:52,338 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:34:52,338 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:34:52,338 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:34:52,338 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:34:52,338 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:34:52,338 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:34:52,338 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:34:52,338 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:34:52,339 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:34:52,339 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_46f32a55-a887-466b-ba7f-e58115f37acd/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ec9a57be1d36dda380e5a4e58b869e7f4707b06 [2018-11-10 11:34:52,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:34:52,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:34:52,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:34:52,374 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:34:52,374 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:34:52,374 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_46f32a55-a887-466b-ba7f-e58115f37acd/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/chunk2_true-termination.c.i [2018-11-10 11:34:52,409 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46f32a55-a887-466b-ba7f-e58115f37acd/bin-2019/uautomizer/data/84e6c064e/567aaa5a18c04da288869735e74bcd5e/FLAG0bfda3065 [2018-11-10 11:34:52,807 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:34:52,808 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_46f32a55-a887-466b-ba7f-e58115f37acd/sv-benchmarks/c/termination-recursive-malloc/chunk2_true-termination.c.i [2018-11-10 11:34:52,812 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46f32a55-a887-466b-ba7f-e58115f37acd/bin-2019/uautomizer/data/84e6c064e/567aaa5a18c04da288869735e74bcd5e/FLAG0bfda3065 [2018-11-10 11:34:52,821 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_46f32a55-a887-466b-ba7f-e58115f37acd/bin-2019/uautomizer/data/84e6c064e/567aaa5a18c04da288869735e74bcd5e [2018-11-10 11:34:52,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:34:52,824 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:34:52,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:34:52,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:34:52,828 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:34:52,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:34:52" (1/1) ... [2018-11-10 11:34:52,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50366430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:52, skipping insertion in model container [2018-11-10 11:34:52,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:34:52" (1/1) ... [2018-11-10 11:34:52,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:34:52,849 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:34:52,949 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:34:52,957 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:34:52,971 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:34:52,981 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:34:52,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:52 WrapperNode [2018-11-10 11:34:52,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:34:52,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:34:52,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:34:52,982 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:34:52,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:52" (1/1) ... [2018-11-10 11:34:52,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:52" (1/1) ... [2018-11-10 11:34:53,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:34:53,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:34:53,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:34:53,010 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:34:53,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:52" (1/1) ... [2018-11-10 11:34:53,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:52" (1/1) ... [2018-11-10 11:34:53,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:52" (1/1) ... [2018-11-10 11:34:53,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:52" (1/1) ... [2018-11-10 11:34:53,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:52" (1/1) ... [2018-11-10 11:34:53,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:52" (1/1) ... [2018-11-10 11:34:53,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:52" (1/1) ... [2018-11-10 11:34:53,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:34:53,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:34:53,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:34:53,030 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:34:53,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46f32a55-a887-466b-ba7f-e58115f37acd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:53,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 11:34:53,103 INFO L130 BoogieDeclarations]: Found specification of procedure chunk [2018-11-10 11:34:53,103 INFO L138 BoogieDeclarations]: Found implementation of procedure chunk [2018-11-10 11:34:53,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 11:34:53,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 11:34:53,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:34:53,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:34:53,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:34:53,298 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:34:53,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:34:53 BoogieIcfgContainer [2018-11-10 11:34:53,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:34:53,299 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:34:53,299 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:34:53,304 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:34:53,305 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:34:53,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:34:52" (1/3) ... [2018-11-10 11:34:53,305 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ef3ddd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:34:53, skipping insertion in model container [2018-11-10 11:34:53,306 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:34:53,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:52" (2/3) ... [2018-11-10 11:34:53,306 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ef3ddd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:34:53, skipping insertion in model container [2018-11-10 11:34:53,306 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:34:53,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:34:53" (3/3) ... [2018-11-10 11:34:53,307 INFO L375 chiAutomizerObserver]: Analyzing ICFG chunk2_true-termination.c.i [2018-11-10 11:34:53,339 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:34:53,340 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:34:53,340 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:34:53,340 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:34:53,340 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:34:53,340 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:34:53,340 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:34:53,340 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:34:53,340 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:34:53,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2018-11-10 11:34:53,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 11:34:53,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:34:53,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:34:53,371 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:53,371 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] [2018-11-10 11:34:53,371 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:34:53,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2018-11-10 11:34:53,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 11:34:53,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:34:53,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:34:53,374 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:53,374 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] [2018-11-10 11:34:53,379 INFO L793 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet15, main_#t~nondet16, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_~data~0.base, main_~data~0.offset, main_~p0~1.base, main_~p0~1.offset, main_~p1~1.base, main_~p1~1.offset, main_~p2~1.base, main_~p2~1.offset, main_~p3~1.base, main_~p3~1.offset, main_~i~0, main_~upper~0, main_~p1_new~0.base, main_~p1_new~0.offset, main_~p2_new~0.base, main_~p2_new~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~data~0.base, main_~data~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p0~1.base, main_~p0~1.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p1~1.base, main_~p1~1.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p2~1.base, main_~p2~1.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p3~1.base, main_~p3~1.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := main_#t~nondet15;havoc main_#t~nondet15;main_~upper~0 := main_#t~nondet16;havoc main_#t~nondet16; 30#L42true assume !(main_~i~0 >= main_~upper~0); 17#L45true SUMMARY for call write~int(main_~i~0, main_~p0~1.base, main_~p0~1.offset, 4); srcloc: L45 13#L45-1true SUMMARY for call write~int(main_~upper~0, main_~p3~1.base, main_~p3~1.offset, 4); srcloc: L45-1 39#L46true SUMMARY for call write~$Pointer$(main_~p0~1.base, main_~p0~1.offset, main_~data~0.base, main_~data~0.offset + 0, 8); srcloc: L46 26#L50true SUMMARY for call write~$Pointer$(main_~p1~1.base, main_~p1~1.offset, main_~data~0.base, main_~data~0.offset + 8, 8); srcloc: L50 7#L51true SUMMARY for call write~$Pointer$(main_~p2~1.base, main_~p2~1.offset, main_~data~0.base, main_~data~0.offset + 16, 8); srcloc: L51 29#L52true SUMMARY for call write~$Pointer$(main_~p3~1.base, main_~p3~1.offset, main_~data~0.base, main_~data~0.offset + 24, 8); srcloc: L52 31#L53true call chunk(main_~data~0.base, main_~data~0.offset);< 18#chunkENTRYtrue [2018-11-10 11:34:53,380 INFO L795 eck$LassoCheckResult]: Loop: 18#chunkENTRYtrue ~data.base, ~data.offset := #in~data.base, #in~data.offset; 20#L9true SUMMARY for call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~data.base, ~data.offset + 0, 8); srcloc: L9 16#L9-1true ~p0~0.base, ~p0~0.offset := #t~mem1.base, #t~mem1.offset;havoc #t~mem1.base, #t~mem1.offset; 32#L10true SUMMARY for call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~data.base, ~data.offset + 8, 8); srcloc: L10 40#L10-1true ~p1~0.base, ~p1~0.offset := #t~mem2.base, #t~mem2.offset;havoc #t~mem2.base, #t~mem2.offset; 14#L11true SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~data.base, ~data.offset + 16, 8); srcloc: L11 11#L11-1true ~p2~0.base, ~p2~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; 34#L12true SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~data.base, ~data.offset + 24, 8); srcloc: L12 38#L12-1true ~p3~0.base, ~p3~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; 8#L14true SUMMARY for call #t~mem5 := read~int(~p0~0.base, ~p0~0.offset, 4); srcloc: L14 4#L14-1true SUMMARY for call #t~mem6 := read~int(~p3~0.base, ~p3~0.offset, 4); srcloc: L14-1 35#L14-2true assume !(#t~mem5 >= #t~mem6);havoc #t~mem5;havoc #t~mem6; 24#L17true SUMMARY for call #t~mem7 := read~int(~p0~0.base, ~p0~0.offset, 4); srcloc: L17 22#L17-1true #t~post8 := #t~mem7; 23#L17-2true SUMMARY for call write~int(#t~post8 + 1, ~p0~0.base, ~p0~0.offset, 4); srcloc: L17-2 28#L17-3true havoc #t~mem7;havoc #t~post8;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p1~0.base, ~p1~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true; 12#L22true SUMMARY for call write~$Pointer$(~p2~0.base, ~p2~0.offset, ~data.base, ~data.offset + 8, 8); srcloc: L22 10#L22-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 6#L23true SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~data.base, ~data.offset + 16, 8); srcloc: L23 37#L23-1true call chunk(~data.base, ~data.offset);< 18#chunkENTRYtrue [2018-11-10 11:34:53,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:53,384 INFO L82 PathProgramCache]: Analyzing trace with hash -167384239, now seen corresponding path program 1 times [2018-11-10 11:34:53,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:53,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:53,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:53,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:53,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:53,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:53,522 INFO L82 PathProgramCache]: Analyzing trace with hash 277833766, now seen corresponding path program 1 times [2018-11-10 11:34:53,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:53,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:53,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:53,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:53,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:53,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:53,556 INFO L82 PathProgramCache]: Analyzing trace with hash 725519222, now seen corresponding path program 1 times [2018-11-10 11:34:53,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:53,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:53,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:53,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:53,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:54,376 WARN L179 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 165 [2018-11-10 11:34:54,544 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-11-10 11:34:54,753 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 11:34:56,507 WARN L179 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 194 DAG size of output: 179 [2018-11-10 11:34:56,890 WARN L179 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2018-11-10 11:34:57,217 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2018-11-10 11:34:57,350 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-10 11:34:57,359 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:34:57,360 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:34:57,360 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:34:57,360 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:34:57,360 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:34:57,361 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:57,361 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:34:57,361 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:34:57,361 INFO L131 ssoRankerPreferences]: Filename of dumped script: chunk2_true-termination.c.i_Iteration1_Lasso [2018-11-10 11:34:57,361 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:34:57,361 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:34:57,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:57,750 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2018-11-10 11:34:58,020 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2018-11-10 11:34:58,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,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-11-10 11:34:58,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,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-11-10 11:34:58,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-11-10 11:34:58,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-11-10 11:34:58,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-11-10 11:34:58,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,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-11-10 11:34:58,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-11-10 11:34:58,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,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-11-10 11:34:58,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,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-11-10 11:34:58,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,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-11-10 11:34:58,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,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-11-10 11:34:58,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-11-10 11:34:58,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-11-10 11:34:58,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,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-11-10 11:34:58,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-11-10 11:34:58,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-11-10 11:34:58,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-11-10 11:34:58,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,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-11-10 11:34:58,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,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-11-10 11:34:58,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,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-11-10 11:34:58,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:58,513 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:34:58,516 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:34:58,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,522 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,526 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,530 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,534 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,538 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:58,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:34:58,543 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,545 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,549 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,554 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,558 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,561 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,563 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,565 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,567 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,575 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,578 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,581 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,592 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,595 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:58,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:34:58,599 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,601 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:58,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:58,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:58,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,604 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:34:58,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,605 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:34:58,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:34:58,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:58,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:34:58,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:58,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:34:58,630 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:58,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:58,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:58,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:58,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:58,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:58,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:58,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:34:58,658 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:34:58,670 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 11:34:58,670 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 11:34:58,672 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:34:58,673 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:34:58,673 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:34:58,674 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int (select (select #memory_$Pointer$.base chunk_#in~data.base) chunk_#in~data.offset)) (select (select #memory_$Pointer$.offset chunk_#in~data.base) chunk_#in~data.offset))_1, v_rep(let ((.cse0 (+ chunk_#in~data.offset 24))) (select (select #memory_int (select (select #memory_$Pointer$.base chunk_#in~data.base) .cse0)) (select (select #memory_$Pointer$.offset chunk_#in~data.base) .cse0)))_1) = -1*v_rep(select (select #memory_int (select (select #memory_$Pointer$.base chunk_#in~data.base) chunk_#in~data.offset)) (select (select #memory_$Pointer$.offset chunk_#in~data.base) chunk_#in~data.offset))_1 + 1*v_rep(let ((.cse0 (+ chunk_#in~data.offset 24))) (select (select #memory_int (select (select #memory_$Pointer$.base chunk_#in~data.base) .cse0)) (select (select #memory_$Pointer$.offset chunk_#in~data.base) .cse0)))_1 Supporting invariants [] [2018-11-10 11:34:58,748 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-10 11:34:58,755 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 11:34:58,756 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 11:34:58,756 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 11:34:58,756 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 11:34:58,757 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:34:58,758 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 11:34:58,758 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 11:34:58,758 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:34:58,758 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 11:34:58,758 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 11:34:58,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:58,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:34:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:58,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:34:59,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 121 [2018-11-10 11:34:59,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 83 [2018-11-10 11:34:59,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,095 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 110 [2018-11-10 11:34:59,100 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:34:59,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:34:59,135 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:107, output treesize:118 [2018-11-10 11:34:59,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 79 [2018-11-10 11:34:59,189 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,190 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,191 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 76 [2018-11-10 11:34:59,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 68 [2018-11-10 11:34:59,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 79 [2018-11-10 11:34:59,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2018-11-10 11:34:59,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,297 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,298 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 65 [2018-11-10 11:34:59,301 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,309 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 75 [2018-11-10 11:34:59,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 77 [2018-11-10 11:34:59,335 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,345 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:34:59,360 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:170, output treesize:118 [2018-11-10 11:34:59,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2018-11-10 11:34:59,371 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,372 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,373 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 65 [2018-11-10 11:34:59,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 79 [2018-11-10 11:34:59,412 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,414 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 76 [2018-11-10 11:34:59,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 64 [2018-11-10 11:34:59,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 79 [2018-11-10 11:34:59,454 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,462 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 75 [2018-11-10 11:34:59,482 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:34:59,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 77 [2018-11-10 11:34:59,486 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,495 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:34:59,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:34:59,509 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:170, output treesize:118 [2018-11-10 11:34:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:34:59,519 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 12 loop predicates [2018-11-10 11:34:59,520 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states. Second operand 13 states. [2018-11-10 11:35:00,166 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states.. Second operand 13 states. Result 116 states and 121 transitions. Complement of second has 52 states. [2018-11-10 11:35:00,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-11-10 11:35:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 11:35:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 37 transitions. [2018-11-10 11:35:00,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 37 transitions. Stem has 10 letters. Loop has 20 letters. [2018-11-10 11:35:00,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:35:00,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 37 transitions. Stem has 30 letters. Loop has 20 letters. [2018-11-10 11:35:00,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:35:00,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 37 transitions. Stem has 10 letters. Loop has 40 letters. [2018-11-10 11:35:00,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:35:00,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 121 transitions. [2018-11-10 11:35:00,178 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:35:00,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 0 states and 0 transitions. [2018-11-10 11:35:00,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:35:00,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:35:00,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:35:00,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:35:00,181 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:35:00,181 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:35:00,181 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:35:00,181 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:35:00,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:35:00,182 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:35:00,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:35:00,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:35:00 BoogieIcfgContainer [2018-11-10 11:35:00,185 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:35:00,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:35:00,186 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:35:00,186 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:35:00,186 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:34:53" (3/4) ... [2018-11-10 11:35:00,189 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:35:00,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:35:00,189 INFO L168 Benchmark]: Toolchain (without parser) took 7365.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 960.2 MB in the beginning and 1.3 GB in the end (delta: -292.8 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:35:00,190 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:35:00,190 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.63 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:35:00,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.30 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:35:00,191 INFO L168 Benchmark]: Boogie Preprocessor took 19.54 ms. Allocated memory is still 1.0 GB. Free memory was 946.8 MB in the beginning and 944.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:35:00,191 INFO L168 Benchmark]: RCFGBuilder took 269.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:35:00,191 INFO L168 Benchmark]: BuchiAutomizer took 6886.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -126.4 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:35:00,192 INFO L168 Benchmark]: Witness Printer took 3.11 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:35:00,194 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.11 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 156.63 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.30 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.54 ms. Allocated memory is still 1.0 GB. Free memory was 946.8 MB in the beginning and 944.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 269.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6886.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -126.4 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.11 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[#memory_$Pointer$[data][data]][#memory_$Pointer$[data][data]] + unknown-#memory_int-unknown[#memory_$Pointer$[data][data + 24]][#memory_$Pointer$[data][data + 24]] and consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 19 SDtfs, 48 SDslu, 37 SDs, 0 SdLazy, 139 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital535 mio100 ax100 hnf99 lsp98 ukn52 mio100 lsp25 div100 bol100 ite100 ukn100 eq190 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...