./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1d99232a-4101-4f7c-b391-a614ba3cd5c4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1d99232a-4101-4f7c-b391-a614ba3cd5c4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1d99232a-4101-4f7c-b391-a614ba3cd5c4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1d99232a-4101-4f7c-b391-a614ba3cd5c4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1d99232a-4101-4f7c-b391-a614ba3cd5c4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1d99232a-4101-4f7c-b391-a614ba3cd5c4/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f46bc2ae974c991af4b779b5b664b98522d3f13 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 10:36:32,299 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 10:36:32,300 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 10:36:32,306 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 10:36:32,306 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 10:36:32,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 10:36:32,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 10:36:32,308 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 10:36:32,308 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 10:36:32,309 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 10:36:32,309 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 10:36:32,309 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 10:36:32,310 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 10:36:32,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 10:36:32,311 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 10:36:32,311 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 10:36:32,312 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 10:36:32,313 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 10:36:32,313 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 10:36:32,314 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 10:36:32,315 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 10:36:32,315 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 10:36:32,316 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 10:36:32,316 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 10:36:32,317 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 10:36:32,317 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 10:36:32,318 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 10:36:32,318 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 10:36:32,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 10:36:32,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 10:36:32,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 10:36:32,319 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 10:36:32,320 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 10:36:32,320 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 10:36:32,320 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 10:36:32,321 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 10:36:32,321 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1d99232a-4101-4f7c-b391-a614ba3cd5c4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 10:36:32,328 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 10:36:32,328 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 10:36:32,329 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 10:36:32,329 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 10:36:32,329 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 10:36:32,330 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 10:36:32,330 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 10:36:32,330 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 10:36:32,330 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 10:36:32,330 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 10:36:32,330 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 10:36:32,330 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 10:36:32,331 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 10:36:32,331 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 10:36:32,331 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 10:36:32,331 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 10:36:32,331 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 10:36:32,331 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 10:36:32,331 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 10:36:32,331 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 10:36:32,331 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 10:36:32,331 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 10:36:32,331 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 10:36:32,332 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 10:36:32,332 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 10:36:32,332 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 10:36:32,332 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 10:36:32,332 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 10:36:32,332 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 10:36:32,332 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 10:36:32,332 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 10:36:32,333 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 10:36:32,333 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_1d99232a-4101-4f7c-b391-a614ba3cd5c4/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f46bc2ae974c991af4b779b5b664b98522d3f13 [2018-12-08 10:36:32,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 10:36:32,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 10:36:32,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 10:36:32,363 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 10:36:32,363 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 10:36:32,363 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1d99232a-4101-4f7c-b391-a614ba3cd5c4/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-12-08 10:36:32,405 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1d99232a-4101-4f7c-b391-a614ba3cd5c4/bin-2019/uautomizer/data/eb12eb36e/5adf74ce41e74ad89c050610a09b3bfc/FLAG3dcb2c4a6 [2018-12-08 10:36:32,857 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 10:36:32,857 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1d99232a-4101-4f7c-b391-a614ba3cd5c4/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-12-08 10:36:32,865 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1d99232a-4101-4f7c-b391-a614ba3cd5c4/bin-2019/uautomizer/data/eb12eb36e/5adf74ce41e74ad89c050610a09b3bfc/FLAG3dcb2c4a6 [2018-12-08 10:36:32,873 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1d99232a-4101-4f7c-b391-a614ba3cd5c4/bin-2019/uautomizer/data/eb12eb36e/5adf74ce41e74ad89c050610a09b3bfc [2018-12-08 10:36:32,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 10:36:32,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 10:36:32,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 10:36:32,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 10:36:32,879 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 10:36:32,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:36:32" (1/1) ... [2018-12-08 10:36:32,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33416e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:36:32, skipping insertion in model container [2018-12-08 10:36:32,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:36:32" (1/1) ... [2018-12-08 10:36:32,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 10:36:32,907 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 10:36:33,135 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:36:33,147 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 10:36:33,188 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:36:33,226 INFO L195 MainTranslator]: Completed translation [2018-12-08 10:36:33,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:36:33 WrapperNode [2018-12-08 10:36:33,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 10:36:33,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 10:36:33,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 10:36:33,227 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 10:36:33,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:36:33" (1/1) ... [2018-12-08 10:36:33,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:36:33" (1/1) ... [2018-12-08 10:36:33,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 10:36:33,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 10:36:33,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 10:36:33,265 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 10:36:33,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:36:33" (1/1) ... [2018-12-08 10:36:33,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:36:33" (1/1) ... [2018-12-08 10:36:33,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:36:33" (1/1) ... [2018-12-08 10:36:33,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:36:33" (1/1) ... [2018-12-08 10:36:33,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:36:33" (1/1) ... [2018-12-08 10:36:33,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:36:33" (1/1) ... [2018-12-08 10:36:33,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:36:33" (1/1) ... [2018-12-08 10:36:33,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 10:36:33,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 10:36:33,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 10:36:33,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 10:36:33,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:36:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1d99232a-4101-4f7c-b391-a614ba3cd5c4/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:36:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 10:36:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 10:36:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 10:36:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-12-08 10:36:33,316 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-12-08 10:36:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 10:36:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 10:36:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 10:36:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 10:36:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 10:36:33,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 10:36:33,390 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 10:36:33,488 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 10:36:33,488 INFO L280 CfgBuilder]: Removed 32 assue(true) statements. [2018-12-08 10:36:33,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:36:33 BoogieIcfgContainer [2018-12-08 10:36:33,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 10:36:33,489 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 10:36:33,489 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 10:36:33,491 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 10:36:33,491 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:36:33,492 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 10:36:32" (1/3) ... [2018-12-08 10:36:33,492 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5223e75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:36:33, skipping insertion in model container [2018-12-08 10:36:33,492 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:36:33,492 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:36:33" (2/3) ... [2018-12-08 10:36:33,492 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5223e75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:36:33, skipping insertion in model container [2018-12-08 10:36:33,492 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:36:33,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:36:33" (3/3) ... [2018-12-08 10:36:33,494 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-12-08 10:36:33,523 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 10:36:33,524 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 10:36:33,524 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 10:36:33,524 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 10:36:33,524 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 10:36:33,524 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 10:36:33,524 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 10:36:33,524 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 10:36:33,524 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 10:36:33,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-12-08 10:36:33,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-08 10:36:33,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:36:33,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:36:33,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:36:33,551 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-08 10:36:33,551 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 10:36:33,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-12-08 10:36:33,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-08 10:36:33,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:36:33,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:36:33,553 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:36:33,553 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-08 10:36:33,556 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-12-08 10:36:33,556 INFO L796 eck$LassoCheckResult]: Loop: 28#L-1-1true assume #t~loopctr39 < #amount;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr39 := #value];#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];#t~loopctr39 := 1 + #t~loopctr39; 28#L-1-1true [2018-12-08 10:36:33,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:36:33,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1711236933, now seen corresponding path program 1 times [2018-12-08 10:36:33,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:36:33,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:36:33,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:36:33,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:36:33,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:36:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:36:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:36:33,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:36:33,640 INFO L82 PathProgramCache]: Analyzing trace with hash 36, now seen corresponding path program 1 times [2018-12-08 10:36:33,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:36:33,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:36:33,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:36:33,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:36:33,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:36:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:36:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:36:33,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:36:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1508737366, now seen corresponding path program 1 times [2018-12-08 10:36:33,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:36:33,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:36:33,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:36:33,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:36:33,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:36:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:36:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:36:33,853 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2018-12-08 10:36:34,059 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-12-08 10:36:34,108 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:36:34,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:36:34,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:36:34,109 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:36:34,109 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:36:34,110 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:36:34,110 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:36:34,110 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:36:34,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test22_1_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-12-08 10:36:34,110 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:36:34,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:36:34,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,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-12-08 10:36:34,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,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-12-08 10:36:34,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-12-08 10:36:34,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:36:34,613 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:36:34,616 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:36:34,617 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-12-08 10:36:34,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,621 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-12-08 10:36:34,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,623 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-12-08 10:36:34,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,624 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-12-08 10:36:34,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,626 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-12-08 10:36:34,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,627 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-12-08 10:36:34,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,629 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-12-08 10:36:34,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,630 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-12-08 10:36:34,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,631 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-12-08 10:36:34,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,633 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-12-08 10:36:34,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:36:34,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:36:34,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:36:34,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,639 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-12-08 10:36:34,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,641 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-12-08 10:36:34,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,642 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-12-08 10:36:34,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,644 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-12-08 10:36:34,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:36:34,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:36:34,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,647 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-12-08 10:36:34,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,649 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-12-08 10:36:34,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,650 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-12-08 10:36:34,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,652 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-12-08 10:36:34,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,653 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-12-08 10:36:34,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,655 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-12-08 10:36:34,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:36:34,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:36:34,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,658 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-12-08 10:36:34,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:36:34,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:36:34,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:36:34,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,660 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-12-08 10:36:34,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:36:34,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:36:34,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,664 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-12-08 10:36:34,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,664 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:36:34,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,665 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:36:34,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:36:34,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,668 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-12-08 10:36:34,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:36:34,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:36:34,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,672 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-12-08 10:36:34,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:36:34,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:36:34,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,677 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-12-08 10:36:34,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:36:34,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:36:34,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,681 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-12-08 10:36:34,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:36:34,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:36:34,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,685 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-12-08 10:36:34,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:36:34,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:36:34,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,688 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-12-08 10:36:34,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:36:34,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:36:34,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,692 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-12-08 10:36:34,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,692 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:36:34,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,693 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:36:34,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:36:34,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:36:34,695 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-12-08 10:36:34,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:36:34,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:36:34,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:36:34,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:36:34,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:36:34,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:36:34,706 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:36:34,718 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 10:36:34,718 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-08 10:36:34,719 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:36:34,720 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 10:36:34,720 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:36:34,721 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-12-08 10:36:34,744 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-08 10:36:34,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #amount [2018-12-08 10:36:34,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:36:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:36:34,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:36:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:36:34,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:36:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:36:34,803 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-12-08 10:36:34,803 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 2 states. [2018-12-08 10:36:34,833 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-12-08 10:36:34,833 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-12-08 10:36:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-12-08 10:36:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-12-08 10:36:34,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 8 letters. Loop has 1 letters. [2018-12-08 10:36:34,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:36:34,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 9 letters. Loop has 1 letters. [2018-12-08 10:36:34,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:36:34,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-08 10:36:34,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:36:34,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-12-08 10:36:34,839 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 10:36:34,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2018-12-08 10:36:34,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 10:36:34,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 10:36:34,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 10:36:34,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 10:36:34,842 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:36:34,842 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:36:34,842 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:36:34,842 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 10:36:34,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 10:36:34,843 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 10:36:34,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 10:36:34,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 10:36:34 BoogieIcfgContainer [2018-12-08 10:36:34,846 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 10:36:34,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 10:36:34,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 10:36:34,847 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 10:36:34,847 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:36:33" (3/4) ... [2018-12-08 10:36:34,849 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 10:36:34,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 10:36:34,850 INFO L168 Benchmark]: Toolchain (without parser) took 1974.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 951.7 MB in the beginning and 969.7 MB in the end (delta: -18.1 MB). Peak memory consumption was 111.4 MB. Max. memory is 11.5 GB. [2018-12-08 10:36:34,850 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:36:34,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-12-08 10:36:34,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.03 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 10:36:34,851 INFO L168 Benchmark]: Boogie Preprocessor took 18.31 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 10:36:34,852 INFO L168 Benchmark]: RCFGBuilder took 205.64 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-12-08 10:36:34,852 INFO L168 Benchmark]: BuchiAutomizer took 1357.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 969.7 MB in the end (delta: 102.5 MB). Peak memory consumption was 102.5 MB. Max. memory is 11.5 GB. [2018-12-08 10:36:34,852 INFO L168 Benchmark]: Witness Printer took 2.74 ms. Allocated memory is still 1.2 GB. Free memory is still 969.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:36:34,854 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 350.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.03 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.31 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 205.64 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1357.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 969.7 MB in the end (delta: 102.5 MB). Peak memory consumption was 102.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.74 ms. Allocated memory is still 1.2 GB. Free memory is still 969.7 MB. 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 1.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. 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: 4ms 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...