./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f46bc2ae974c991af4b779b5b664b98522d3f13 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:12:22,088 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:12:22,089 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:12:22,101 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:12:22,102 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:12:22,103 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:12:22,104 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:12:22,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:12:22,108 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:12:22,109 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:12:22,110 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:12:22,110 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:12:22,111 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:12:22,112 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:12:22,113 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:12:22,114 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:12:22,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:12:22,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:12:22,119 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:12:22,121 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:12:22,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:12:22,124 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:12:22,126 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:12:22,126 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:12:22,127 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:12:22,127 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:12:22,129 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:12:22,130 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:12:22,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:12:22,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:12:22,132 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:12:22,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:12:22,134 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:12:22,134 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:12:22,135 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:12:22,136 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:12:22,137 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:12:22,158 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:12:22,158 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:12:22,160 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:12:22,160 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:12:22,160 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:12:22,160 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:12:22,160 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:12:22,161 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:12:22,161 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:12:22,161 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:12:22,161 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:12:22,161 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:12:22,161 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:12:22,163 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:12:22,163 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:12:22,163 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:12:22,163 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:12:22,164 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:12:22,164 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:12:22,164 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:12:22,164 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:12:22,164 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:12:22,164 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:12:22,166 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:12:22,167 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:12:22,167 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:12:22,167 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:12:22,167 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:12:22,167 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:12:22,168 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:12:22,168 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:12:22,169 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:12:22,169 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f46bc2ae974c991af4b779b5b664b98522d3f13 [2018-11-29 00:12:22,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:12:22,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:12:22,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:12:22,251 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:12:22,252 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:12:22,253 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-11-29 00:12:22,327 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca2b78ed/baa62615ce02438da61b0d185c9a77fc/FLAG75baa87bd [2018-11-29 00:12:22,937 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:12:22,938 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-11-29 00:12:22,963 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca2b78ed/baa62615ce02438da61b0d185c9a77fc/FLAG75baa87bd [2018-11-29 00:12:23,198 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca2b78ed/baa62615ce02438da61b0d185c9a77fc [2018-11-29 00:12:23,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:12:23,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:12:23,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:12:23,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:12:23,210 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:12:23,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:12:23" (1/1) ... [2018-11-29 00:12:23,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef7e597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:23, skipping insertion in model container [2018-11-29 00:12:23,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:12:23" (1/1) ... [2018-11-29 00:12:23,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:12:23,293 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:12:23,827 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:12:23,856 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:12:24,043 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:12:24,135 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:12:24,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:24 WrapperNode [2018-11-29 00:12:24,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:12:24,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:12:24,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:12:24,138 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:12:24,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:24" (1/1) ... [2018-11-29 00:12:24,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:24" (1/1) ... [2018-11-29 00:12:24,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:12:24,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:12:24,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:12:24,206 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:12:24,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:24" (1/1) ... [2018-11-29 00:12:24,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:24" (1/1) ... [2018-11-29 00:12:24,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:24" (1/1) ... [2018-11-29 00:12:24,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:24" (1/1) ... [2018-11-29 00:12:24,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:24" (1/1) ... [2018-11-29 00:12:24,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:24" (1/1) ... [2018-11-29 00:12:24,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:24" (1/1) ... [2018-11-29 00:12:24,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:12:24,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:12:24,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:12:24,262 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:12:24,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-29 00:12:24,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:12:24,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:12:24,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:12:24,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-29 00:12:24,340 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-29 00:12:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-29 00:12:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-29 00:12:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:12:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-29 00:12:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:12:24,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:12:24,503 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-29 00:12:24,897 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:12:24,898 INFO L280 CfgBuilder]: Removed 32 assue(true) statements. [2018-11-29 00:12:24,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:24 BoogieIcfgContainer [2018-11-29 00:12:24,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:12:24,899 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:12:24,900 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:12:24,903 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:12:24,904 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:24,904 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:12:23" (1/3) ... [2018-11-29 00:12:24,905 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@93f0e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:12:24, skipping insertion in model container [2018-11-29 00:12:24,905 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:24,905 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:24" (2/3) ... [2018-11-29 00:12:24,906 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@93f0e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:12:24, skipping insertion in model container [2018-11-29 00:12:24,906 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:24,906 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:24" (3/3) ... [2018-11-29 00:12:24,908 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-11-29 00:12:24,974 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:12:24,975 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:12:24,975 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:12:24,975 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:12:24,975 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:12:24,975 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:12:24,975 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:12:24,976 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:12:24,976 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:12:24,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-29 00:12:25,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-29 00:12:25,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:25,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:25,029 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:12:25,029 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:12:25,029 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:12:25,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-29 00:12:25,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-29 00:12:25,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:25,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:25,035 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:12:25,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:12:25,043 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 12#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_~kobj~2.base, entry_point_~kobj~2.offset;havoc entry_point_~kobj~2.base, entry_point_~kobj~2.offset;havoc ldv_kobject_create_#res.base, ldv_kobject_create_#res.offset;havoc ldv_kobject_create_#t~ret34.base, ldv_kobject_create_#t~ret34.offset, ldv_kobject_create_#t~memset~res35.base, ldv_kobject_create_#t~memset~res35.offset, ldv_kobject_create_~kobj~1.base, ldv_kobject_create_~kobj~1.offset;havoc ldv_kobject_create_~kobj~1.base, ldv_kobject_create_~kobj~1.offset;ldv_malloc_#in~size := 16;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 14#L1073true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 19#L1076true ldv_kobject_create_#t~ret34.base, ldv_kobject_create_#t~ret34.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;ldv_kobject_create_~kobj~1.base, ldv_kobject_create_~kobj~1.offset := ldv_kobject_create_#t~ret34.base, ldv_kobject_create_#t~ret34.offset;havoc ldv_kobject_create_#t~ret34.base, ldv_kobject_create_#t~ret34.offset; 7#L1409true assume !(ldv_kobject_create_~kobj~1.base == 0 && ldv_kobject_create_~kobj~1.offset == 0); 4#L1411true call ldv_kobject_create_#t~memset~res35.base, ldv_kobject_create_#t~memset~res35.offset := #Ultimate.C_memset(ldv_kobject_create_~kobj~1.base, ldv_kobject_create_~kobj~1.offset, 0, 16);< 17##Ultimate.C_memsetENTRYtrue assume 1 == #valid[#ptr.base];assume #amount + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; 13#$Ultimate##0true #t~loopctr39 := 0; 28#L-1-1true [2018-11-29 00:12:25,043 INFO L796 eck$LassoCheckResult]: Loop: 28#L-1-1true assume #t~loopctr39 < #amount;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr39 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr39 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr39 := #value];#t~loopctr39 := 1 + #t~loopctr39; 28#L-1-1true [2018-11-29 00:12:25,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:25,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1711236933, now seen corresponding path program 1 times [2018-11-29 00:12:25,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:25,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:25,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:25,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:25,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:25,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:25,241 INFO L82 PathProgramCache]: Analyzing trace with hash 36, now seen corresponding path program 1 times [2018-11-29 00:12:25,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:25,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:25,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:25,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:25,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:25,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:25,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1508737366, now seen corresponding path program 1 times [2018-11-29 00:12:25,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:25,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:25,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:25,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:25,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:26,244 WARN L180 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2018-11-29 00:12:26,557 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-29 00:12:26,754 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-29 00:12:27,145 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-11-29 00:12:27,266 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:12:27,267 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:12:27,267 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:12:27,268 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:12:27,268 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:12:27,268 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:12:27,268 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:12:27,268 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:12:27,269 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test22_1_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-29 00:12:27,269 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:12:27,270 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:12:27,308 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-29 00:12:27,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:27,355 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-29 00:12:27,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:27,361 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-29 00:12:27,366 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-29 00:12:27,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:27,394 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-29 00:12:27,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-29 00:12:27,406 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-29 00:12:27,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-29 00:12:27,425 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-29 00:12:27,427 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-29 00:12:27,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-29 00:12:27,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-29 00:12:27,440 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-29 00:12:27,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-29 00:12:27,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-29 00:12:27,456 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-29 00:12:27,462 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-29 00:12:27,465 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-29 00:12:27,475 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-29 00:12:27,480 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-29 00:12:27,703 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2018-11-29 00:12:27,743 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-29 00:12:27,746 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-29 00:12:27,750 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-29 00:12:27,753 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-29 00:12:27,776 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-29 00:12:27,782 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-29 00:12:27,786 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-29 00:12:27,812 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-29 00:12:27,825 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-29 00:12:27,830 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-29 00:12:27,832 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-29 00:12:27,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:27,838 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-29 00:12:27,840 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-29 00:12:27,847 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-29 00:12:27,852 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-29 00:12:27,854 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-29 00:12:27,855 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-29 00:12:27,857 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-29 00:12:27,860 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-29 00:12:27,863 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-29 00:12:27,870 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-29 00:12:27,872 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-29 00:12:27,877 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-29 00:12:27,880 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-29 00:12:27,882 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-29 00:12:27,889 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-29 00:12:27,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:27,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:27,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:27,904 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-29 00:12:27,906 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-29 00:12:27,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:27,914 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-29 00:12:27,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:27,919 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-29 00:12:27,922 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-29 00:12:27,923 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-29 00:12:27,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:27,930 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-29 00:12:27,948 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-29 00:12:27,958 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-29 00:12:27,960 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-29 00:12:27,962 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-29 00:12:27,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:27,967 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-29 00:12:27,970 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-29 00:12:27,976 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-29 00:12:27,995 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-29 00:12:28,001 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-29 00:12:28,003 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-29 00:12:28,005 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-29 00:12:28,008 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-29 00:12:28,010 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-29 00:12:28,012 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-29 00:12:28,017 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-29 00:12:28,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,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-29 00:12:28,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,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-29 00:12:28,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,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-29 00:12:28,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-29 00:12:28,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-29 00:12:28,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-29 00:12:28,042 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-29 00:12:28,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-29 00:12:28,046 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-29 00:12:28,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-29 00:12:28,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-29 00:12:28,053 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-29 00:12:28,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-29 00:12:28,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-29 00:12:28,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-29 00:12:28,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-29 00:12:28,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-29 00:12:28,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-29 00:12:28,067 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-29 00:12:28,069 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-29 00:12:28,071 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-29 00:12:28,073 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-29 00:12:28,076 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-29 00:12:28,078 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-29 00:12:28,080 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-29 00:12:29,021 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:12:29,027 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:12:29,030 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-29 00:12:29,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,039 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-29 00:12:29,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,042 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-29 00:12:29,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,046 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-29 00:12:29,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,051 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-29 00:12:29,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,056 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-29 00:12:29,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,062 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-29 00:12:29,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,069 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-29 00:12:29,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,074 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-29 00:12:29,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,080 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-29 00:12:29,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,086 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-29 00:12:29,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,107 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-29 00:12:29,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,111 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-29 00:12:29,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,118 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-29 00:12:29,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,126 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-29 00:12:29,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,145 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-29 00:12:29,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,152 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-29 00:12:29,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,159 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-29 00:12:29,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,168 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-29 00:12:29,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,174 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-29 00:12:29,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,179 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-29 00:12:29,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,187 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-29 00:12:29,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,192 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-29 00:12:29,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,193 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:12:29,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,195 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:12:29,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,203 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-29 00:12:29,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,218 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-29 00:12:29,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,232 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-29 00:12:29,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,255 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-29 00:12:29,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,273 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-29 00:12:29,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,291 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-29 00:12:29,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,298 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-29 00:12:29,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,308 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-29 00:12:29,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,309 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:12:29,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,310 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:12:29,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,317 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-29 00:12:29,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,355 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:12:29,400 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-29 00:12:29,400 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-29 00:12:29,405 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:12:29,407 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:12:29,408 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:12:29,408 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memset_#amount, #Ultimate.C_memset_#t~loopctr39) = 1*#Ultimate.C_memset_#amount - 1*#Ultimate.C_memset_#t~loopctr39 Supporting invariants [] [2018-11-29 00:12:29,491 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:12:29,497 WARN L1298 BoogieBacktranslator]: unknown boogie variable #amount [2018-11-29 00:12:29,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:29,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:29,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:29,597 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-29 00:12:29,612 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-29 00:12:29,613 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 2 states. [2018-11-29 00:12:29,757 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 2 states. Result 39 states and 50 transitions. Complement of second has 6 states. [2018-11-29 00:12:29,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:12:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-29 00:12:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-29 00:12:29,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 8 letters. Loop has 1 letters. [2018-11-29 00:12:29,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:29,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 9 letters. Loop has 1 letters. [2018-11-29 00:12:29,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:29,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-29 00:12:29,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:29,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-11-29 00:12:29,773 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:12:29,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2018-11-29 00:12:29,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:12:29,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:12:29,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:12:29,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:12:29,780 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:29,780 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:29,781 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:29,781 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:12:29,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:12:29,781 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:12:29,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:12:29,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:12:29 BoogieIcfgContainer [2018-11-29 00:12:29,791 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:12:29,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:12:29,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:12:29,792 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:12:29,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:24" (3/4) ... [2018-11-29 00:12:29,798 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:12:29,798 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:12:29,802 INFO L168 Benchmark]: Toolchain (without parser) took 6599.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:29,805 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:29,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 930.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:29,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:29,808 INFO L168 Benchmark]: Boogie Preprocessor took 55.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:29,808 INFO L168 Benchmark]: RCFGBuilder took 637.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:29,809 INFO L168 Benchmark]: BuchiAutomizer took 4891.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -41.5 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:29,810 INFO L168 Benchmark]: Witness Printer took 6.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:29,818 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 930.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 637.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4891.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -41.5 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Witness Printer took 6.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #amount * 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 unknown-#amount-unknown + -1 * aux-#t~loopctr39-aux and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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: 23 SDtfs, 23 SDslu, 1 SDs, 0 SdLazy, 6 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital170 mio100 ax117 hnf101 lsp80 ukn50 mio100 lsp28 div100 bol100 ite100 ukn100 eq200 hnf89 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 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...