./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0df80a84-5888-487a-b0f1-8e203bf52db4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0df80a84-5888-487a-b0f1-8e203bf52db4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0df80a84-5888-487a-b0f1-8e203bf52db4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0df80a84-5888-487a-b0f1-8e203bf52db4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0df80a84-5888-487a-b0f1-8e203bf52db4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0df80a84-5888-487a-b0f1-8e203bf52db4/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 f96fdc95fb6e9912f13e4890488921a4cb17c15a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:34:47,140 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:34:47,141 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:34:47,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:34:47,150 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:34:47,150 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:34:47,151 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:34:47,153 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:34:47,154 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:34:47,154 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:34:47,155 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:34:47,155 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:34:47,156 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:34:47,157 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:34:47,158 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:34:47,158 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:34:47,159 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:34:47,160 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:34:47,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:34:47,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:34:47,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:34:47,164 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:34:47,166 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:34:47,166 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:34:47,166 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:34:47,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:34:47,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:34:47,168 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:34:47,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:34:47,170 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:34:47,170 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:34:47,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:34:47,171 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:34:47,171 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:34:47,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:34:47,172 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:34:47,173 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0df80a84-5888-487a-b0f1-8e203bf52db4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 13:34:47,184 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:34:47,185 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:34:47,186 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:34:47,186 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:34:47,186 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:34:47,186 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:34:47,186 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:34:47,186 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:34:47,187 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:34:47,187 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:34:47,187 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:34:47,187 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:34:47,187 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:34:47,187 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:34:47,187 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:34:47,188 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:34:47,188 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:34:47,188 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:34:47,188 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:34:47,188 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:34:47,188 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:34:47,188 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:34:47,189 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:34:47,189 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:34:47,189 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:34:47,189 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:34:47,189 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:34:47,189 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:34:47,189 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:34:47,190 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:34:47,190 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:34:47,190 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:34:47,191 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_0df80a84-5888-487a-b0f1-8e203bf52db4/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 -> f96fdc95fb6e9912f13e4890488921a4cb17c15a [2018-11-28 13:34:47,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:34:47,224 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:34:47,228 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:34:47,229 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:34:47,229 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:34:47,230 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0df80a84-5888-487a-b0f1-8e203bf52db4/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-11-28 13:34:47,273 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0df80a84-5888-487a-b0f1-8e203bf52db4/bin-2019/uautomizer/data/1e9c6cf9f/b1fbde80fd5a4ac2b2c972baad1d2df6/FLAGdb96f914c [2018-11-28 13:34:47,650 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:34:47,651 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0df80a84-5888-487a-b0f1-8e203bf52db4/sv-benchmarks/c/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-11-28 13:34:47,659 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0df80a84-5888-487a-b0f1-8e203bf52db4/bin-2019/uautomizer/data/1e9c6cf9f/b1fbde80fd5a4ac2b2c972baad1d2df6/FLAGdb96f914c [2018-11-28 13:34:47,670 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0df80a84-5888-487a-b0f1-8e203bf52db4/bin-2019/uautomizer/data/1e9c6cf9f/b1fbde80fd5a4ac2b2c972baad1d2df6 [2018-11-28 13:34:47,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:34:47,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:34:47,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:34:47,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:34:47,676 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:34:47,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:34:47" (1/1) ... [2018-11-28 13:34:47,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b0f4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:34:47, skipping insertion in model container [2018-11-28 13:34:47,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:34:47" (1/1) ... [2018-11-28 13:34:47,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:34:47,714 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:34:47,977 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:34:47,988 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:34:48,032 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:34:48,074 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:34:48,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:34:48 WrapperNode [2018-11-28 13:34:48,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:34:48,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:34:48,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:34:48,075 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:34:48,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:34:48" (1/1) ... [2018-11-28 13:34:48,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:34:48" (1/1) ... [2018-11-28 13:34:48,106 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:34:48,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:34:48,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:34:48,107 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:34:48,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:34:48" (1/1) ... [2018-11-28 13:34:48,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:34:48" (1/1) ... [2018-11-28 13:34:48,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:34:48" (1/1) ... [2018-11-28 13:34:48,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:34:48" (1/1) ... [2018-11-28 13:34:48,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:34:48" (1/1) ... [2018-11-28 13:34:48,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:34:48" (1/1) ... [2018-11-28 13:34:48,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:34:48" (1/1) ... [2018-11-28 13:34:48,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:34:48,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:34:48,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:34:48,127 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:34:48,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:34:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0df80a84-5888-487a-b0f1-8e203bf52db4/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:34:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:34:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:34:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:34:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:34:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 13:34:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:34:48,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:34:48,331 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:34:48,331 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-28 13:34:48,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:34:48 BoogieIcfgContainer [2018-11-28 13:34:48,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:34:48,332 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:34:48,332 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:34:48,335 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:34:48,336 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:34:48,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:34:47" (1/3) ... [2018-11-28 13:34:48,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13bb71c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:34:48, skipping insertion in model container [2018-11-28 13:34:48,337 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:34:48,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:34:48" (2/3) ... [2018-11-28 13:34:48,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13bb71c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:34:48, skipping insertion in model container [2018-11-28 13:34:48,337 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:34:48,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:34:48" (3/3) ... [2018-11-28 13:34:48,338 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-11-28 13:34:48,372 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:34:48,373 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:34:48,373 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:34:48,373 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:34:48,373 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:34:48,373 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:34:48,373 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:34:48,374 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:34:48,374 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:34:48,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-28 13:34:48,398 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 13:34:48,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:34:48,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:34:48,404 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 13:34:48,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:34:48,405 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:34:48,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-28 13:34:48,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 13:34:48,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:34:48,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:34:48,407 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 13:34:48,407 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:34:48,411 INFO L794 eck$LassoCheckResult]: Stem: 13#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); 9#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;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; 16#L1073true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 11#L1076true entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 5#L1441true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 4#L1445-3true [2018-11-28 13:34:48,411 INFO L796 eck$LassoCheckResult]: Loop: 4#L1445-3true assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;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; 18#L1073-1true 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; 12#L1076-1true entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 15#L1447true assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 3#L1445-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 4#L1445-3true [2018-11-28 13:34:48,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:48,415 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2018-11-28 13:34:48,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:48,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:48,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:48,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:34:48,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:34:48,550 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:34:48,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:48,550 INFO L82 PathProgramCache]: Analyzing trace with hash 47811737, now seen corresponding path program 1 times [2018-11-28 13:34:48,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:48,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:48,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:48,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:48,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:48,779 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-28 13:34:48,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:34:48,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:34:48,850 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2018-11-28 13:34:48,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:48,905 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-28 13:34:48,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:34:48,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-11-28 13:34:48,908 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-28 13:34:48,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 25 transitions. [2018-11-28 13:34:48,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 13:34:48,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 13:34:48,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-28 13:34:48,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:34:48,912 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-28 13:34:48,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-28 13:34:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-11-28 13:34:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 13:34:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-28 13:34:48,931 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 13:34:48,931 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 13:34:48,931 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:34:48,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-28 13:34:48,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 13:34:48,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:34:48,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:34:48,932 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 13:34:48,932 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:34:48,933 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY #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); 67#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;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; 68#L1073 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; 69#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 64#L1441 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 61#L1445-3 [2018-11-28 13:34:48,933 INFO L796 eck$LassoCheckResult]: Loop: 61#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;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; 63#L1073-1 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; 70#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 71#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 60#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 61#L1445-3 [2018-11-28 13:34:48,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:48,933 INFO L82 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2018-11-28 13:34:48,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:48,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:48,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:48,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:48,949 INFO L82 PathProgramCache]: Analyzing trace with hash 47811737, now seen corresponding path program 2 times [2018-11-28 13:34:48,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:48,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:48,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:48,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:48,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:48,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:48,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1232444971, now seen corresponding path program 1 times [2018-11-28 13:34:48,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:48,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:48,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:48,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:34:48,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:49,121 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-28 13:34:49,280 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-11-28 13:34:49,338 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:34:49,339 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:34:49,339 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:34:49,339 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:34:49,339 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:34:49,339 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:34:49,339 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:34:49,340 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:34:49,340 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-28 13:34:49,340 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:34:49,340 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:34:49,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:49,916 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:34:49,921 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:34:49,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:49,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:49,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:49,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:49,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:49,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:49,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:49,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:49,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:49,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:49,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:49,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:49,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:49,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:49,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:49,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:49,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:49,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:49,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:49,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:49,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:49,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:49,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:49,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:49,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:49,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:49,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:49,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:49,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:49,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:49,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:49,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:49,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:49,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:49,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:49,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:49,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:49,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:49,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:49,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:49,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:49,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:49,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:49,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:49,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:49,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:49,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:49,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:49,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:49,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:49,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:49,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:49,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:49,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:49,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:49,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:49,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:49,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:49,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:49,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:49,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:49,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:49,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:49,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:49,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:49,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:49,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:49,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:49,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:49,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:50,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:50,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:50,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:50,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:50,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:50,010 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:34:50,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:50,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:50,012 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:34:50,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:50,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:50,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:50,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:50,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:50,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:50,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:50,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:50,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:50,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:50,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:50,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:50,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:50,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:50,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:50,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:50,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:50,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:50,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:50,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:50,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:50,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:50,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:50,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:50,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:50,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:50,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:50,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:50,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:50,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:50,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:50,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:50,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:50,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:50,099 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:34:50,125 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:34:50,125 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 13:34:50,127 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:34:50,129 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:34:50,129 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:34:50,130 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~0) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~0 Supporting invariants [] [2018-11-28 13:34:50,159 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-28 13:34:50,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:50,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:34:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:50,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:34:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:50,206 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:34:50,207 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 13:34:50,239 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 27 states and 36 transitions. Complement of second has 6 states. [2018-11-28 13:34:50,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 13:34:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:34:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-28 13:34:50,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-28 13:34:50,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:34:50,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-28 13:34:50,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:34:50,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 13:34:50,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:34:50,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2018-11-28 13:34:50,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:34:50,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 26 transitions. [2018-11-28 13:34:50,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 13:34:50,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 13:34:50,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2018-11-28 13:34:50,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:34:50,245 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-28 13:34:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2018-11-28 13:34:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-28 13:34:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 13:34:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-28 13:34:50,247 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-28 13:34:50,247 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-28 13:34:50,247 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:34:50,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-28 13:34:50,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:34:50,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:34:50,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:34:50,248 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:34:50,248 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:34:50,248 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #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); 182#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;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; 183#L1073 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; 184#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 179#L1441 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 175#L1445-3 assume !(entry_point_~i~0 < entry_point_~len~0); 176#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 181#L1452-3 [2018-11-28 13:34:50,248 INFO L796 eck$LassoCheckResult]: Loop: 181#L1452-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 180#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 181#L1452-3 [2018-11-28 13:34:50,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:50,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966489, now seen corresponding path program 1 times [2018-11-28 13:34:50,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:50,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:50,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:50,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:50,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:34:50,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:34:50,292 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:34:50,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:50,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2018-11-28 13:34:50,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:50,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:50,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:50,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:34:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:34:50,326 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 13:34:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:50,367 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-11-28 13:34:50,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:34:50,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-11-28 13:34:50,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:34:50,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2018-11-28 13:34:50,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 13:34:50,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 13:34:50,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2018-11-28 13:34:50,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:34:50,370 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-28 13:34:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2018-11-28 13:34:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-11-28 13:34:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 13:34:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-11-28 13:34:50,372 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-28 13:34:50,372 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-28 13:34:50,372 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:34:50,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2018-11-28 13:34:50,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:34:50,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:34:50,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:34:50,373 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:34:50,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:34:50,373 INFO L794 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY #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); 233#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;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; 234#L1073 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; 235#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 230#L1441 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 226#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;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; 228#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 236#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 237#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 229#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 231#L1452-3 [2018-11-28 13:34:50,373 INFO L796 eck$LassoCheckResult]: Loop: 231#L1452-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 232#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 231#L1452-3 [2018-11-28 13:34:50,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1232385447, now seen corresponding path program 1 times [2018-11-28 13:34:50,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:50,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:50,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:50,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:50,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 2 times [2018-11-28 13:34:50,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:50,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:50,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:50,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:50,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1088560603, now seen corresponding path program 1 times [2018-11-28 13:34:50,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:50,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:34:50,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:50,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:34:50,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:34:50,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:34:50,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:34:50,502 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-28 13:34:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:50,535 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-28 13:34:50,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:34:50,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-28 13:34:50,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:34:50,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2018-11-28 13:34:50,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 13:34:50,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 13:34:50,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2018-11-28 13:34:50,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:34:50,537 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-28 13:34:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2018-11-28 13:34:50,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-11-28 13:34:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 13:34:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-28 13:34:50,539 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-28 13:34:50,539 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-28 13:34:50,539 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:34:50,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-28 13:34:50,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:34:50,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:34:50,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:34:50,540 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:34:50,540 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:34:50,540 INFO L794 eck$LassoCheckResult]: Stem: 294#ULTIMATE.startENTRY #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); 287#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;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; 288#L1073 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; 289#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 284#L1441 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 280#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;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; 281#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 292#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 293#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 278#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 279#L1445-3 assume !(entry_point_~i~0 < entry_point_~len~0); 282#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 285#L1452-3 [2018-11-28 13:34:50,540 INFO L796 eck$LassoCheckResult]: Loop: 285#L1452-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 286#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 285#L1452-3 [2018-11-28 13:34:50,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:50,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1088615463, now seen corresponding path program 1 times [2018-11-28 13:34:50,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:50,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:50,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:50,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:50,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:34:50,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:34:50,565 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:34:50,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:50,566 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 3 times [2018-11-28 13:34:50,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:50,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:50,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:50,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:34:50,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:34:50,597 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 13:34:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:50,620 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-28 13:34:50,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:34:50,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2018-11-28 13:34:50,623 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-28 13:34:50,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2018-11-28 13:34:50,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 13:34:50,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 13:34:50,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2018-11-28 13:34:50,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:34:50,624 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-28 13:34:50,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2018-11-28 13:34:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-11-28 13:34:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 13:34:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-28 13:34:50,628 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 13:34:50,628 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 13:34:50,628 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 13:34:50,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-28 13:34:50,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:34:50,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:34:50,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:34:50,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:34:50,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:34:50,629 INFO L794 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY #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); 340#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;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; 341#L1073 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; 342#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 337#L1441 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 333#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;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; 334#L1073-1 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; 345#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 346#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 331#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 332#L1445-3 assume !(entry_point_~i~0 < entry_point_~len~0); 335#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 339#L1452-3 [2018-11-28 13:34:50,630 INFO L796 eck$LassoCheckResult]: Loop: 339#L1452-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 338#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 339#L1452-3 [2018-11-28 13:34:50,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:50,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1031357161, now seen corresponding path program 1 times [2018-11-28 13:34:50,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:50,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:50,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:34:50,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:50,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:34:50,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0df80a84-5888-487a-b0f1-8e203bf52db4/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:34:50,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:50,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:34:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:50,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:34:50,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-28 13:34:50,761 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:34:50,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:50,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 4 times [2018-11-28 13:34:50,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:50,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:50,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:50,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:34:50,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:34:50,788 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-28 13:34:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:50,814 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-28 13:34:50,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:34:50,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-11-28 13:34:50,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:34:50,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2018-11-28 13:34:50,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 13:34:50,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 13:34:50,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2018-11-28 13:34:50,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:34:50,817 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-28 13:34:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2018-11-28 13:34:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2018-11-28 13:34:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 13:34:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-28 13:34:50,819 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-28 13:34:50,819 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-28 13:34:50,819 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 13:34:50,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2018-11-28 13:34:50,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:34:50,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:34:50,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:34:50,820 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:34:50,820 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:34:50,820 INFO L794 eck$LassoCheckResult]: Stem: 440#ULTIMATE.startENTRY #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); 433#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;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; 434#L1073 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; 435#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 429#L1441 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 425#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;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; 426#L1073-1 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; 444#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 441#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 423#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 424#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;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; 427#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 436#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 437#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 430#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 431#L1452-3 [2018-11-28 13:34:50,820 INFO L796 eck$LassoCheckResult]: Loop: 431#L1452-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 432#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 431#L1452-3 [2018-11-28 13:34:50,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:50,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1033365559, now seen corresponding path program 1 times [2018-11-28 13:34:50,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:50,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:34:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:50,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 5 times [2018-11-28 13:34:50,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:50,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:50,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:50,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:50,847 INFO L82 PathProgramCache]: Analyzing trace with hash -926855349, now seen corresponding path program 1 times [2018-11-28 13:34:50,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:50,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:50,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:34:50,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:34:51,239 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 141 [2018-11-28 13:34:51,305 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:34:51,306 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:34:51,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:34:51,306 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:34:51,306 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:34:51,306 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:34:51,306 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:34:51,306 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:34:51,306 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-28 13:34:51,306 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:34:51,306 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:34:51,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-11-28 13:34:51,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-11-28 13:34:51,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-11-28 13:34:51,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-11-28 13:34:51,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-11-28 13:34:51,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:34:51,621 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:34:51,621 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:34:51,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-11-28 13:34:51,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:51,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:51,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:51,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-11-28 13:34:51,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:51,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:51,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:51,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:51,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:51,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:51,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:51,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:51,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:51,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:51,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:51,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:51,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:51,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:51,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:51,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:51,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:51,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:51,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:51,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:51,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:51,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:51,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:51,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:51,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:51,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:51,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-11-28 13:34:51,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:51,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:51,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:51,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:51,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-11-28 13:34:51,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:51,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:51,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:51,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:51,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:51,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:51,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:51,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:51,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:51,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:51,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:51,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:51,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:51,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-11-28 13:34:51,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:34:51,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:34:51,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:34:51,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:51,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:51,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:51,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:51,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:51,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:51,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:51,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:51,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:34:51,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:34:51,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:34:51,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:34:51,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:34:51,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:34:51,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:34:51,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:34:51,681 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:34:51,698 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2018-11-28 13:34:51,698 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 13:34:51,698 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:34:51,699 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:34:51,699 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:34:51,699 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_2, ULTIMATE.start_entry_point_~j~0) = 1*v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_2 + 8*ULTIMATE.start_entry_point_~j~0 Supporting invariants [] [2018-11-28 13:34:51,744 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-28 13:34:51,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:34:51,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:51,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:34:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:51,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:34:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:51,788 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:34:51,788 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 13:34:51,795 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2018-11-28 13:34:51,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:34:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:34:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-28 13:34:51,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-28 13:34:51,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:34:51,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-28 13:34:51,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:34:51,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-28 13:34:51,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:34:51,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-11-28 13:34:51,798 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:34:51,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-28 13:34:51,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:34:51,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:34:51,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:34:51,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:34:51,799 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:34:51,799 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:34:51,799 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:34:51,799 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 13:34:51,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:34:51,799 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:34:51,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:34:51,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:34:51 BoogieIcfgContainer [2018-11-28 13:34:51,805 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:34:51,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:34:51,806 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:34:51,806 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:34:51,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:34:48" (3/4) ... [2018-11-28 13:34:51,809 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:34:51,809 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:34:51,810 INFO L168 Benchmark]: Toolchain (without parser) took 4137.28 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 950.6 MB in the beginning and 828.0 MB in the end (delta: 122.7 MB). Peak memory consumption was 345.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:34:51,810 INFO L168 Benchmark]: CDTParser took 0.17 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-11-28 13:34:51,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:34:51,811 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.12 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:34:51,812 INFO L168 Benchmark]: Boogie Preprocessor took 19.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:34:51,812 INFO L168 Benchmark]: RCFGBuilder took 204.91 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.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:34:51,812 INFO L168 Benchmark]: BuchiAutomizer took 3473.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 828.0 MB in the end (delta: 268.1 MB). Peak memory consumption was 338.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:34:51,813 INFO L168 Benchmark]: Witness Printer took 3.60 ms. Allocated memory is still 1.3 GB. Free memory is still 828.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:34:51,815 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.17 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 401.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.12 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 204.91 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.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3473.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 828.0 MB in the end (delta: 268.1 MB). Peak memory consumption was 338.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.60 ms. Allocated memory is still 1.3 GB. Free memory is still 828.0 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 #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + 8 * j and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 42 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 115 SDtfs, 128 SDslu, 119 SDs, 0 SdLazy, 98 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital237 mio100 ax112 hnf101 lsp81 ukn53 mio100 lsp58 div100 bol100 ite100 ukn100 eq188 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 3 VariablesLoop: 4 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...