./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1_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_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/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 fcf7d7a4067ef9712cccdc61e57c274773cdfd53 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 11:16:38,247 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:16:38,248 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:16:38,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:16:38,259 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:16:38,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:16:38,261 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:16:38,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:16:38,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:16:38,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:16:38,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:16:38,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:16:38,267 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:16:38,267 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:16:38,268 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:16:38,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:16:38,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:16:38,272 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:16:38,274 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:16:38,276 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:16:38,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:16:38,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:16:38,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:16:38,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:16:38,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:16:38,282 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:16:38,283 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:16:38,284 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:16:38,284 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:16:38,285 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:16:38,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:16:38,287 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:16:38,287 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:16:38,287 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:16:38,288 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:16:38,289 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:16:38,289 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 11:16:38,303 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:16:38,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:16:38,305 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:16:38,305 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:16:38,305 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:16:38,305 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:16:38,305 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:16:38,306 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:16:38,307 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:16:38,307 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:16:38,307 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:16:38,307 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:16:38,307 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:16:38,308 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:16:38,308 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:16:38,308 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:16:38,308 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:16:38,308 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:16:38,308 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:16:38,309 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:16:38,309 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:16:38,309 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:16:38,309 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:16:38,309 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:16:38,310 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:16:38,310 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:16:38,310 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:16:38,310 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:16:38,310 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:16:38,311 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:16:38,311 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:16:38,312 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:16:38,312 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_b890572b-3dde-4c5b-afdf-309fb6dc7cec/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 -> fcf7d7a4067ef9712cccdc61e57c274773cdfd53 [2018-11-28 11:16:38,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:16:38,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:16:38,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:16:38,357 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:16:38,358 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:16:38,358 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-11-28 11:16:38,416 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/data/caa218c3c/a0fe78f821904d718487fe29de7fc5e3/FLAG1f779b0a4 [2018-11-28 11:16:38,836 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:16:38,837 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-11-28 11:16:38,849 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/data/caa218c3c/a0fe78f821904d718487fe29de7fc5e3/FLAG1f779b0a4 [2018-11-28 11:16:38,860 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/data/caa218c3c/a0fe78f821904d718487fe29de7fc5e3 [2018-11-28 11:16:38,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:16:38,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:16:38,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:16:38,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:16:38,868 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:16:38,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:16:38" (1/1) ... [2018-11-28 11:16:38,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634333b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:38, skipping insertion in model container [2018-11-28 11:16:38,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:16:38" (1/1) ... [2018-11-28 11:16:38,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:16:38,913 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:16:39,258 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:16:39,277 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:16:39,334 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:16:39,380 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:16:39,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39 WrapperNode [2018-11-28 11:16:39,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:16:39,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:16:39,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:16:39,381 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:16:39,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:16:39,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:16:39,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:16:39,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:16:39,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:16:39,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:16:39,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:16:39,460 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:16:39,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/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 11:16:39,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:16:39,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:16:39,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:16:39,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:16:39,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 11:16:39,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:16:39,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:16:39,834 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:16:39,834 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-28 11:16:39,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:16:39 BoogieIcfgContainer [2018-11-28 11:16:39,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:16:39,836 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:16:39,836 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:16:39,840 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:16:39,841 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:16:39,841 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:16:38" (1/3) ... [2018-11-28 11:16:39,843 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37534fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:16:39, skipping insertion in model container [2018-11-28 11:16:39,843 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:16:39,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (2/3) ... [2018-11-28 11:16:39,843 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37534fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:16:39, skipping insertion in model container [2018-11-28 11:16:39,843 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:16:39,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:16:39" (3/3) ... [2018-11-28 11:16:39,845 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-11-28 11:16:39,891 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:16:39,891 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:16:39,892 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:16:39,892 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:16:39,892 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:16:39,892 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:16:39,892 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:16:39,892 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:16:39,892 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:16:39,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-28 11:16:39,922 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-28 11:16:39,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:39,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:39,928 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:39,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:16:39,928 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:16:39,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-28 11:16:39,930 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-28 11:16:39,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:39,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:39,931 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:39,931 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:16:39,935 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); 10#L-1true havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 20#L1468true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 26#L1469-3true [2018-11-28 11:16:39,935 INFO L796 eck$LassoCheckResult]: Loop: 26#L1469-3true assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 21#L1469-2true entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 26#L1469-3true [2018-11-28 11:16:39,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:39,940 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2018-11-28 11:16:39,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:39,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:39,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:39,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:39,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:40,085 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 11:16:40,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:16:40,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:16:40,090 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:16:40,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:40,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 1 times [2018-11-28 11:16:40,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:40,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:40,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:40,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:40,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:16:40,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:16:40,226 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2018-11-28 11:16:40,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:40,295 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-28 11:16:40,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:16:40,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 53 transitions. [2018-11-28 11:16:40,298 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2018-11-28 11:16:40,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 33 states and 41 transitions. [2018-11-28 11:16:40,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-28 11:16:40,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-28 11:16:40,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-11-28 11:16:40,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:40,304 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-28 11:16:40,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-11-28 11:16:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-11-28 11:16:40,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 11:16:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-11-28 11:16:40,328 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-28 11:16:40,328 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-28 11:16:40,328 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:16:40,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2018-11-28 11:16:40,328 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-28 11:16:40,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:40,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:40,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:40,329 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:16:40,329 INFO L794 eck$LassoCheckResult]: Stem: 96#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); 90#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 91#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; 92#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 93#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 100#L1469-3 [2018-11-28 11:16:40,329 INFO L796 eck$LassoCheckResult]: Loop: 100#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 101#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 100#L1469-3 [2018-11-28 11:16:40,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:40,330 INFO L82 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2018-11-28 11:16:40,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:40,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:40,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:40,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:40,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:40,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:40,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 2 times [2018-11-28 11:16:40,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:40,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:40,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:40,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:40,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:40,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:40,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966535, now seen corresponding path program 1 times [2018-11-28 11:16:40,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:40,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:40,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:40,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:40,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:40,601 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-11-28 11:16:40,669 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:16:40,670 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:16:40,670 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:16:40,671 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:16:40,671 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:16:40,671 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:16:40,671 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:16:40,671 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:16:40,672 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-28 11:16:40,672 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:16:40,672 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:16:40,697 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 11:16:40,701 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 11:16:40,703 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 11:16:40,857 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-11-28 11:16:40,892 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 11:16:40,894 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 11:16:40,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:16:40,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:16:40,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:16:40,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:16:40,911 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 11:16:40,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:16:40,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:16:40,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:16:41,249 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:16:41,253 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:16:41,254 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 11:16:41,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:41,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:41,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:41,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:41,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:41,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:41,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:41,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:41,262 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 11:16:41,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:41,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:41,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:41,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:41,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:41,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:41,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:41,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:41,265 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 11:16:41,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:41,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:41,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:41,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:41,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:16:41,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:41,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:41,274 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 11:16:41,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:41,275 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:16:41,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:41,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:41,278 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:16:41,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:41,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:41,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:16:41,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:41,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:41,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:41,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:41,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:16:41,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:41,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:41,304 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 11:16:41,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:41,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:41,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:41,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:41,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:41,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:41,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:41,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:41,307 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 11:16:41,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:41,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:41,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:41,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:41,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:41,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:41,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:41,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:41,310 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 11:16:41,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:41,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:41,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:41,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:41,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:16:41,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:41,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:41,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:16:41,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:41,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:41,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:41,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:41,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:16:41,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:41,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:41,331 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 11:16:41,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:41,332 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:16:41,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:41,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:41,334 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:16:41,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:41,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:41,346 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 11:16:41,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:41,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:41,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:41,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:41,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:41,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:41,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:41,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:41,349 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 11:16:41,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:41,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:41,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:41,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:41,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:16:41,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:41,424 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:16:41,458 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 11:16:41,458 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 11:16:41,460 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:16:41,462 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:16:41,462 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:16:41,463 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~array~0.offset, ULTIMATE.start_entry_point_~i~2, v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_1) = -1*ULTIMATE.start_entry_point_~array~0.offset - 4*ULTIMATE.start_entry_point_~i~2 + 1*v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_1 Supporting invariants [] [2018-11-28 11:16:41,500 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 11:16:41,506 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:16:41,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:41,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:41,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:41,577 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 11:16:41,580 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 11:16:41,580 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 11:16:41,637 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 50 states and 66 transitions. Complement of second has 7 states. [2018-11-28 11:16:41,637 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 11:16:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:16:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-28 11:16:41,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 11:16:41,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:16:41,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 11:16:41,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:16:41,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 11:16:41,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:16:41,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2018-11-28 11:16:41,644 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2018-11-28 11:16:41,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 35 states and 45 transitions. [2018-11-28 11:16:41,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-28 11:16:41,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-28 11:16:41,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2018-11-28 11:16:41,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:41,645 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-28 11:16:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2018-11-28 11:16:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-11-28 11:16:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 11:16:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-11-28 11:16:41,648 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-28 11:16:41,648 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-28 11:16:41,648 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:16:41,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2018-11-28 11:16:41,649 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:41,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:41,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:41,649 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:41,649 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:41,650 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); 234#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 235#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; 236#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 237#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 244#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 225#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 226#L1443-3 [2018-11-28 11:16:41,650 INFO L796 eck$LassoCheckResult]: Loop: 226#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 233#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; 238#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 239#L1445 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 231#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 226#L1443-3 [2018-11-28 11:16:41,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:41,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966477, now seen corresponding path program 1 times [2018-11-28 11:16:41,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:41,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:41,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:41,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:41,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:41,691 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 11:16:41,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:16:41,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:16:41,692 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:16:41,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:41,692 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 1 times [2018-11-28 11:16:41,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:41,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:41,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:41,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:41,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:41,855 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-28 11:16:41,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:16:41,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:16:41,904 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-28 11:16:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:41,920 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2018-11-28 11:16:41,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:16:41,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2018-11-28 11:16:41,921 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:41,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2018-11-28 11:16:41,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:16:41,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:16:41,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-11-28 11:16:41,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:41,922 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-28 11:16:41,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-11-28 11:16:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-28 11:16:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 11:16:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-28 11:16:41,924 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 11:16:41,924 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 11:16:41,924 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:16:41,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-28 11:16:41,925 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:41,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:41,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:41,926 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:41,926 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:41,926 INFO L794 eck$LassoCheckResult]: Stem: 292#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); 286#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 287#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; 288#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 289#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 296#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 297#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 298#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 277#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 278#L1443-3 [2018-11-28 11:16:41,926 INFO L796 eck$LassoCheckResult]: Loop: 278#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 285#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; 290#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 291#L1445 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 283#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 278#L1443-3 [2018-11-28 11:16:41,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:41,926 INFO L82 PathProgramCache]: Analyzing trace with hash -593946865, now seen corresponding path program 1 times [2018-11-28 11:16:41,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:41,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:41,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:41,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:41,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:41,976 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 11:16:41,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:16:41,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/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 11:16:41,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:42,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:42,046 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 11:16:42,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:16:42,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-28 11:16:42,066 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:16:42,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:42,066 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 2 times [2018-11-28 11:16:42,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:42,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:42,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:42,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:42,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:42,201 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-28 11:16:42,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:16:42,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:16:42,270 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-28 11:16:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:42,290 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-28 11:16:42,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:16:42,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2018-11-28 11:16:42,291 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:42,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 30 transitions. [2018-11-28 11:16:42,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:16:42,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:16:42,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-28 11:16:42,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:42,292 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-28 11:16:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-28 11:16:42,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-28 11:16:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 11:16:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-11-28 11:16:42,295 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-28 11:16:42,295 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-28 11:16:42,295 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:16:42,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2018-11-28 11:16:42,295 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:42,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:42,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:42,296 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:42,296 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:42,296 INFO L794 eck$LassoCheckResult]: Stem: 373#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); 367#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 368#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; 369#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 370#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 377#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 378#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 379#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 380#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 381#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 358#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 359#L1443-3 [2018-11-28 11:16:42,297 INFO L796 eck$LassoCheckResult]: Loop: 359#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 366#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; 371#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 372#L1445 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 364#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 359#L1443-3 [2018-11-28 11:16:42,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:42,297 INFO L82 PathProgramCache]: Analyzing trace with hash 447769425, now seen corresponding path program 2 times [2018-11-28 11:16:42,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:42,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:42,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:42,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:42,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:42,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:16:42,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:16:42,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:16:42,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:16:42,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:16:42,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:42,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:16:42,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-28 11:16:42,433 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:16:42,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:42,433 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 3 times [2018-11-28 11:16:42,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:42,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:42,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:42,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:42,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:42,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:16:42,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:16:42,597 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-11-28 11:16:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:42,623 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-28 11:16:42,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:16:42,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-28 11:16:42,624 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:42,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2018-11-28 11:16:42,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:16:42,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:16:42,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-11-28 11:16:42,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:42,626 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-28 11:16:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-11-28 11:16:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-28 11:16:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 11:16:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-28 11:16:42,628 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-28 11:16:42,628 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-28 11:16:42,628 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:16:42,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-11-28 11:16:42,629 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:42,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:42,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:42,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:42,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:42,629 INFO L794 eck$LassoCheckResult]: Stem: 466#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); 460#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 461#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; 462#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 463#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 470#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 471#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 472#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 476#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 473#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 474#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 475#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 451#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 452#L1443-3 [2018-11-28 11:16:42,630 INFO L796 eck$LassoCheckResult]: Loop: 452#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 459#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; 464#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 465#L1445 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 457#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 452#L1443-3 [2018-11-28 11:16:42,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:42,630 INFO L82 PathProgramCache]: Analyzing trace with hash 809744147, now seen corresponding path program 3 times [2018-11-28 11:16:42,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:42,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:42,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:42,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:42,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:42,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:16:42,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:16:42,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:16:42,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 11:16:42,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:16:42,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:42,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:16:42,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-28 11:16:42,800 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:16:42,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:42,800 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 4 times [2018-11-28 11:16:42,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:42,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:42,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:42,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:42,912 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-28 11:16:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:16:42,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:16:42,956 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 9 Second operand 11 states. [2018-11-28 11:16:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:42,990 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-28 11:16:42,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:16:42,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2018-11-28 11:16:42,991 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:42,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 34 transitions. [2018-11-28 11:16:42,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:16:42,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:16:42,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2018-11-28 11:16:42,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:42,992 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-28 11:16:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2018-11-28 11:16:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-28 11:16:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 11:16:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-28 11:16:42,995 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-28 11:16:42,995 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-28 11:16:42,995 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:16:42,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-11-28 11:16:42,995 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:42,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:42,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:42,996 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:42,996 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:42,996 INFO L794 eck$LassoCheckResult]: Stem: 571#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); 565#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 566#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; 567#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 568#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 575#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 578#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 579#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 576#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 577#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 583#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 582#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 581#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 580#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 556#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 557#L1443-3 [2018-11-28 11:16:42,997 INFO L796 eck$LassoCheckResult]: Loop: 557#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 564#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; 569#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 570#L1445 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 562#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 557#L1443-3 [2018-11-28 11:16:42,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:42,997 INFO L82 PathProgramCache]: Analyzing trace with hash 775101013, now seen corresponding path program 4 times [2018-11-28 11:16:42,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:42,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:42,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:42,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:43,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:16:43,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:16:43,075 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 11:16:43,089 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 11:16:43,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:16:43,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:43,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:16:43,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-28 11:16:43,154 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:16:43,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:43,154 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 5 times [2018-11-28 11:16:43,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:43,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:43,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:43,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:43,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:43,298 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-28 11:16:43,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:16:43,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:16:43,345 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-11-28 11:16:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:43,380 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-28 11:16:43,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:16:43,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2018-11-28 11:16:43,382 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:43,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2018-11-28 11:16:43,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:16:43,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:16:43,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2018-11-28 11:16:43,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:43,383 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-28 11:16:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2018-11-28 11:16:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-28 11:16:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 11:16:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-28 11:16:43,385 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-28 11:16:43,385 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-28 11:16:43,385 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 11:16:43,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2018-11-28 11:16:43,385 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:43,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:43,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:43,386 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:43,386 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:43,386 INFO L794 eck$LassoCheckResult]: Stem: 688#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); 682#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 683#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; 684#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 685#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 692#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 695#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 696#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 693#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 694#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 702#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 701#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 700#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 699#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 698#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 697#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 673#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 674#L1443-3 [2018-11-28 11:16:43,386 INFO L796 eck$LassoCheckResult]: Loop: 674#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 681#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; 686#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 687#L1445 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 679#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 674#L1443-3 [2018-11-28 11:16:43,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1842787607, now seen corresponding path program 5 times [2018-11-28 11:16:43,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:43,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:43,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:43,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:43,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:43,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:16:43,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:16:43,453 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 11:16:43,501 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 11:16:43,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:16:43,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:43,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:16:43,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-28 11:16:43,586 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:16:43,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:43,586 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 6 times [2018-11-28 11:16:43,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:43,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:43,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:43,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:43,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:43,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 11:16:43,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:16:43,732 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. cyclomatic complexity: 9 Second operand 15 states. [2018-11-28 11:16:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:43,775 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-28 11:16:43,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:16:43,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2018-11-28 11:16:43,778 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:43,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 38 transitions. [2018-11-28 11:16:43,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:16:43,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:16:43,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 38 transitions. [2018-11-28 11:16:43,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:43,779 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-28 11:16:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 38 transitions. [2018-11-28 11:16:43,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-28 11:16:43,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 11:16:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-28 11:16:43,783 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-28 11:16:43,783 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-28 11:16:43,783 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 11:16:43,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-11-28 11:16:43,783 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:43,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:43,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:43,784 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:43,784 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:43,784 INFO L794 eck$LassoCheckResult]: Stem: 817#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); 811#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 812#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; 813#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 814#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 821#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 824#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 825#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 822#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 823#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 833#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 832#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 831#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 830#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 829#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 828#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 827#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 826#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 802#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 803#L1443-3 [2018-11-28 11:16:43,785 INFO L796 eck$LassoCheckResult]: Loop: 803#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 810#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; 815#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 816#L1445 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 808#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 803#L1443-3 [2018-11-28 11:16:43,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1392420697, now seen corresponding path program 6 times [2018-11-28 11:16:43,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:43,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:43,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:43,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:43,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:43,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:16:43,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:16:43,860 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 11:16:43,923 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-28 11:16:43,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:16:43,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:44,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:16:44,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-28 11:16:44,041 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:16:44,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:44,042 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 7 times [2018-11-28 11:16:44,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:44,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:44,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:44,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:44,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:44,170 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-28 11:16:44,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 11:16:44,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:16:44,218 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 9 Second operand 17 states. [2018-11-28 11:16:44,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:44,272 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-28 11:16:44,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:16:44,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 40 transitions. [2018-11-28 11:16:44,274 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:44,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 40 transitions. [2018-11-28 11:16:44,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:16:44,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:16:44,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2018-11-28 11:16:44,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:44,275 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-28 11:16:44,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2018-11-28 11:16:44,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-28 11:16:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 11:16:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-28 11:16:44,288 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-28 11:16:44,289 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-28 11:16:44,289 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 11:16:44,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2018-11-28 11:16:44,289 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:44,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:44,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:44,290 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:44,290 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:44,290 INFO L794 eck$LassoCheckResult]: Stem: 958#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); 952#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 953#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; 954#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 955#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 962#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 965#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 966#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 963#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 964#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 976#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 975#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 974#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 973#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 972#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 971#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 970#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 969#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 968#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 967#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 943#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 944#L1443-3 [2018-11-28 11:16:44,290 INFO L796 eck$LassoCheckResult]: Loop: 944#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 951#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; 956#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 957#L1445 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 949#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 944#L1443-3 [2018-11-28 11:16:44,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:44,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1913450213, now seen corresponding path program 7 times [2018-11-28 11:16:44,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:44,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:44,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:44,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:44,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:44,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:16:44,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:16:44,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:44,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:44,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:16:44,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-28 11:16:44,498 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:16:44,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:44,498 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 8 times [2018-11-28 11:16:44,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:44,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:44,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:44,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:44,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 11:16:44,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-11-28 11:16:44,639 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. cyclomatic complexity: 9 Second operand 19 states. [2018-11-28 11:16:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:44,703 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-28 11:16:44,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:16:44,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-11-28 11:16:44,704 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:44,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 42 transitions. [2018-11-28 11:16:44,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:16:44,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:16:44,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 42 transitions. [2018-11-28 11:16:44,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:44,705 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-28 11:16:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 42 transitions. [2018-11-28 11:16:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-28 11:16:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 11:16:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-28 11:16:44,707 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-28 11:16:44,707 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-28 11:16:44,707 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 11:16:44,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2018-11-28 11:16:44,708 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:44,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:44,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:44,708 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:44,708 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:44,709 INFO L794 eck$LassoCheckResult]: Stem: 1111#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); 1105#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 1106#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; 1107#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1108#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1115#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1118#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1119#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1116#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1117#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1131#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1130#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1129#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1128#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1127#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1126#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1125#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1124#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1123#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1122#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1121#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1120#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1096#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1097#L1443-3 [2018-11-28 11:16:44,709 INFO L796 eck$LassoCheckResult]: Loop: 1097#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 1104#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; 1109#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1110#L1445 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1102#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1097#L1443-3 [2018-11-28 11:16:44,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:44,709 INFO L82 PathProgramCache]: Analyzing trace with hash -579595683, now seen corresponding path program 8 times [2018-11-28 11:16:44,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:44,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:44,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:44,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:44,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:44,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:16:44,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:16:44,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:16:44,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:16:44,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:16:44,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:44,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:16:44,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-28 11:16:44,975 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:16:44,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:44,975 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 9 times [2018-11-28 11:16:44,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:44,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:44,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:44,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:44,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:45,088 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-28 11:16:45,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 11:16:45,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-11-28 11:16:45,128 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 9 Second operand 21 states. [2018-11-28 11:16:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:45,178 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-28 11:16:45,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:16:45,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2018-11-28 11:16:45,180 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:45,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 44 transitions. [2018-11-28 11:16:45,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:16:45,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:16:45,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 44 transitions. [2018-11-28 11:16:45,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:45,181 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-28 11:16:45,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 44 transitions. [2018-11-28 11:16:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-28 11:16:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 11:16:45,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-28 11:16:45,183 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-28 11:16:45,183 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-28 11:16:45,183 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 11:16:45,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2018-11-28 11:16:45,184 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:45,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:45,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:45,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:45,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:45,185 INFO L794 eck$LassoCheckResult]: Stem: 1276#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); 1270#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 1271#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; 1272#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1273#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1280#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1283#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1284#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1281#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1282#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1298#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1297#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1296#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1295#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1294#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1293#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1292#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1291#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1290#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1289#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1288#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1287#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1286#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1285#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1261#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1262#L1443-3 [2018-11-28 11:16:45,185 INFO L796 eck$LassoCheckResult]: Loop: 1262#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 1269#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; 1274#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1275#L1445 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1267#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1262#L1443-3 [2018-11-28 11:16:45,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:45,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1354353439, now seen corresponding path program 9 times [2018-11-28 11:16:45,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:45,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:45,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:45,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:45,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:45,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:16:45,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b890572b-3dde-4c5b-afdf-309fb6dc7cec/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:16:45,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:16:45,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-28 11:16:45,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:16:45,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:45,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:16:45,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-28 11:16:45,572 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:16:45,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:45,572 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 10 times [2018-11-28 11:16:45,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:45,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:45,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:45,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:45,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:45,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 11:16:45,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-11-28 11:16:45,711 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 23 states. [2018-11-28 11:16:45,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:45,764 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-28 11:16:45,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:16:45,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 46 transitions. [2018-11-28 11:16:45,765 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:45,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 46 transitions. [2018-11-28 11:16:45,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:16:45,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:16:45,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2018-11-28 11:16:45,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:45,766 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-28 11:16:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2018-11-28 11:16:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-28 11:16:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 11:16:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-28 11:16:45,768 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-28 11:16:45,768 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-28 11:16:45,768 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 11:16:45,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2018-11-28 11:16:45,769 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:16:45,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:45,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:45,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:45,770 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:45,770 INFO L794 eck$LassoCheckResult]: Stem: 1455#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); 1449#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 1450#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; 1451#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1452#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1459#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1462#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1463#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1460#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1461#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1479#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1478#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1477#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1476#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1475#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1474#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1473#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1472#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1471#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1470#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1469#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1468#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1467#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1466#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1465#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1464#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1440#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1441#L1443-3 [2018-11-28 11:16:45,770 INFO L796 eck$LassoCheckResult]: Loop: 1441#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 1448#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; 1453#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1454#L1445 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1446#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1441#L1443-3 [2018-11-28 11:16:45,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:45,770 INFO L82 PathProgramCache]: Analyzing trace with hash 158620513, now seen corresponding path program 10 times [2018-11-28 11:16:45,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:45,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:45,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:45,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:45,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:45,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:45,794 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 11 times [2018-11-28 11:16:45,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:45,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:45,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:45,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:45,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1350358585, now seen corresponding path program 1 times [2018-11-28 11:16:45,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:45,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:45,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:45,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:16:45,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:45,952 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-28 11:18:07,928 WARN L180 SmtUtils]: Spent 1.37 m on a formula simplification. DAG size of input: 348 DAG size of output: 301 [2018-11-28 11:18:07,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:08,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:14,385 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:14,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:20,709 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:20,847 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:25,704 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:25,824 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:30,364 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:30,501 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:34,513 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:34,591 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:38,399 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:38,457 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:40,457 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:40,498 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:41,643 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:41,675 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:42,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:42,468 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 9 variables, input treesize:556, output treesize:408 [2018-11-28 11:18:43,259 WARN L180 SmtUtils]: Spent 790.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-11-28 11:18:43,262 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:18:43,262 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:18:43,262 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:18:43,262 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:18:43,262 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:18:43,262 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:18:43,263 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:18:43,263 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:18:43,263 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1_true-valid-memsafety_true-termination.i_Iteration13_Lasso [2018-11-28 11:18:43,263 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:18:43,263 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:18:43,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,284 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 11:18:43,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:18:43,722 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 11:18:43,723 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 11:18:43,725 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 11:18:43,726 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 11:18:43,728 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 11:18:44,118 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:18:44,119 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:18:44,119 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 11:18:44,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:44,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,127 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 11:18:44,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:44,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:44,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,130 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 11:18:44,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:44,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:44,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,132 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 11:18:44,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,134 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 11:18:44,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,136 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 11:18:44,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,138 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 11:18:44,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:44,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:44,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,142 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 11:18:44,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,144 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 11:18:44,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,146 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 11:18:44,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,148 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 11:18:44,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:44,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:44,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,151 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 11:18:44,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:44,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:44,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,154 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 11:18:44,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,156 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 11:18:44,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:44,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,161 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 11:18:44,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:44,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:44,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,164 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 11:18:44,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:44,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:44,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:44,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,168 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:18:44,168 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:18:44,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,174 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 11:18:44,174 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 11:18:44,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,193 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 11:18:44,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:44,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:44,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,197 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 11:18:44,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,199 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 11:18:44,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,200 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:18:44,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,201 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:18:44,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:44,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:18:44,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,205 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 11:18:44,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,207 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 11:18:44,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,209 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 11:18:44,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,211 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 11:18:44,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:44,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:44,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,214 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 11:18:44,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,217 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 11:18:44,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:18:44,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:18:44,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:18:44,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:18:44,219 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 11:18:44,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:18:44,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:18:44,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:18:44,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:18:44,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:18:44,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:18:44,239 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:18:44,267 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 11:18:44,267 INFO L444 ModelExtractionUtils]: 44 out of 52 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 11:18:44,267 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:18:44,268 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:18:44,269 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:18:44,269 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~i~0, ULTIMATE.start_alloc_17_~len) = -1*ULTIMATE.start_alloc_17_~i~0 + 1*ULTIMATE.start_alloc_17_~len Supporting invariants [] [2018-11-28 11:18:44,325 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 11:18:44,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:44,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:18:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:44,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:18:44,392 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 11:18:44,393 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 11:18:44,393 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 11:18:44,410 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 59 states and 71 transitions. Complement of second has 6 states. [2018-11-28 11:18:44,411 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 11:18:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:18:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-28 11:18:44,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 27 letters. Loop has 5 letters. [2018-11-28 11:18:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:18:44,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-28 11:18:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:18:44,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-28 11:18:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:18:44,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 71 transitions. [2018-11-28 11:18:44,413 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-28 11:18:44,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 47 states and 55 transitions. [2018-11-28 11:18:44,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:18:44,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-28 11:18:44,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 55 transitions. [2018-11-28 11:18:44,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:18:44,415 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-28 11:18:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 55 transitions. [2018-11-28 11:18:44,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-11-28 11:18:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 11:18:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-28 11:18:44,417 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-28 11:18:44,417 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-28 11:18:44,417 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 11:18:44,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2018-11-28 11:18:44,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 11:18:44,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:18:44,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:18:44,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:18:44,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:18:44,424 INFO L794 eck$LassoCheckResult]: Stem: 1705#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); 1697#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 1698#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; 1699#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1700#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1709#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1710#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1711#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1712#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1729#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1728#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1727#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1726#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1725#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1724#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1723#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1722#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1721#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1720#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1719#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1718#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1717#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1716#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1715#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1714#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1713#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1686#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1687#L1443-3 assume !(alloc_17_~i~0 < alloc_17_~len); 1694#L1443-4 alloc_17_#res := 0; 1690#L1454 entry_point_#t~ret46 := alloc_17_#res;havoc entry_point_#t~ret46;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 1691#L1459-3 [2018-11-28 11:18:44,424 INFO L796 eck$LassoCheckResult]: Loop: 1691#L1459-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 1708#L1459-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1691#L1459-3 [2018-11-28 11:18:44,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:44,425 INFO L82 PathProgramCache]: Analyzing trace with hash 999709617, now seen corresponding path program 1 times [2018-11-28 11:18:44,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:44,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:44,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:44,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-28 11:18:44,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:44,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:18:44,469 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:18:44,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:44,469 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2018-11-28 11:18:44,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:44,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:44,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:44,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:44,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:18:44,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:18:44,496 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-28 11:18:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:44,519 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-11-28 11:18:44,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:18:44,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 68 transitions. [2018-11-28 11:18:44,521 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 11:18:44,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 68 transitions. [2018-11-28 11:18:44,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-28 11:18:44,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 11:18:44,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 68 transitions. [2018-11-28 11:18:44,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:18:44,522 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 68 transitions. [2018-11-28 11:18:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 68 transitions. [2018-11-28 11:18:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2018-11-28 11:18:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 11:18:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-28 11:18:44,524 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-28 11:18:44,525 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-28 11:18:44,525 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 11:18:44,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2018-11-28 11:18:44,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 11:18:44,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:18:44,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:18:44,526 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:18:44,526 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:18:44,526 INFO L794 eck$LassoCheckResult]: Stem: 1814#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); 1806#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 1807#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; 1808#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1809#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1818#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1819#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1820#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1821#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1838#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1837#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1836#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1835#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1834#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1833#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1832#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1831#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1830#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1829#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1828#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1827#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1826#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1825#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1824#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1823#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1822#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1795#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1796#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 1803#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1810#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1811#L1445 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1797#L1445-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1798#L1450-3 [2018-11-28 11:18:44,526 INFO L796 eck$LassoCheckResult]: Loop: 1798#L1450-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1815#L1450-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1798#L1450-3 [2018-11-28 11:18:44,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:44,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1350299059, now seen corresponding path program 1 times [2018-11-28 11:18:44,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:44,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:44,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:44,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:44,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2018-11-28 11:18:44,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:44,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:44,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:44,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:44,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:44,557 INFO L82 PathProgramCache]: Analyzing trace with hash -557270321, now seen corresponding path program 1 times [2018-11-28 11:18:44,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:44,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:44,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:44,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-28 11:18:44,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:44,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:18:44,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:18:44,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:18:44,671 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 11:18:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:44,692 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-28 11:18:44,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:18:44,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 69 transitions. [2018-11-28 11:18:44,694 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 11:18:44,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 69 transitions. [2018-11-28 11:18:44,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-28 11:18:44,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-28 11:18:44,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 69 transitions. [2018-11-28 11:18:44,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:18:44,695 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-28 11:18:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 69 transitions. [2018-11-28 11:18:44,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2018-11-28 11:18:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 11:18:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-11-28 11:18:44,697 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-11-28 11:18:44,698 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-11-28 11:18:44,698 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-28 11:18:44,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 57 transitions. [2018-11-28 11:18:44,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 11:18:44,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:18:44,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:18:44,699 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:18:44,699 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:18:44,699 INFO L794 eck$LassoCheckResult]: Stem: 1930#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); 1922#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 1923#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; 1924#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1925#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1935#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1936#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1937#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1938#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1958#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1957#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1956#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1955#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1954#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1953#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1951#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1949#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1947#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1946#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1945#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1944#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1943#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1942#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1941#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1940#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1939#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1910#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1911#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 1918#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1926#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1927#L1445 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1912#L1445-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1913#L1450-3 assume !(alloc_17_~j~0 >= 0); 1933#L1450-4 alloc_17_#res := 3; 1914#L1454 entry_point_#t~ret46 := alloc_17_#res;havoc entry_point_#t~ret46;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 1915#L1459-3 [2018-11-28 11:18:44,699 INFO L796 eck$LassoCheckResult]: Loop: 1915#L1459-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 1934#L1459-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1915#L1459-3 [2018-11-28 11:18:44,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:44,700 INFO L82 PathProgramCache]: Analyzing trace with hash -95512495, now seen corresponding path program 1 times [2018-11-28 11:18:44,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:44,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:44,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:44,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:44,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:44,727 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 2 times [2018-11-28 11:18:44,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:44,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:44,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:44,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:44,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1593191981, now seen corresponding path program 1 times [2018-11-28 11:18:44,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:44,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:44,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:18:44,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:18:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:20:24,242 WARN L180 SmtUtils]: Spent 1.66 m on a formula simplification. DAG size of input: 388 DAG size of output: 337 [2018-11-28 11:20:24,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:24,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:33,365 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:33,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:41,262 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:41,345 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:45,586 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:45,678 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:49,767 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:49,859 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:53,048 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:53,133 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:54,650 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:54,682 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:56,269 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:56,288 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:57,582 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:57,604 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:58,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:58,638 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 9 variables, input treesize:605, output treesize:452 [2018-11-28 11:20:59,484 WARN L180 SmtUtils]: Spent 845.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-11-28 11:20:59,487 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:20:59,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:20:59,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:20:59,487 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:20:59,487 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:20:59,487 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:20:59,487 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:20:59,487 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:20:59,487 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1_true-valid-memsafety_true-termination.i_Iteration16_Lasso [2018-11-28 11:20:59,487 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:20:59,487 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:20:59,490 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 11:20:59,752 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 11:20:59,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:20:59,754 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 11:20:59,756 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 11:20:59,758 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 11:20:59,760 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 11:20:59,761 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 11:20:59,762 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 11:20:59,763 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 11:20:59,765 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 11:20:59,766 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 11:20:59,767 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 11:20:59,769 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 11:20:59,770 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 11:20:59,771 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 11:20:59,773 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 11:20:59,780 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 11:20:59,781 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 11:20:59,783 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 11:20:59,784 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 11:20:59,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:20:59,787 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 11:20:59,788 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 11:20:59,791 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 11:20:59,792 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 11:20:59,793 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 11:20:59,795 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 11:20:59,796 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 11:20:59,797 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 11:20:59,799 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 11:21:00,147 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:21:00,147 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:21:00,148 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 11:21:00,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:21:00,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:21:00,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:21:00,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:21:00,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:21:00,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:21:00,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:21:00,151 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 11:21:00,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:21:00,151 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:21:00,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:21:00,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:21:00,153 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:21:00,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:21:00,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:21:00,157 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 11:21:00,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:21:00,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:21:00,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:21:00,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:21:00,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:21:00,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:21:00,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:21:00,163 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 11:21:00,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:21:00,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:21:00,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:21:00,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:21:00,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:21:00,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:21:00,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:21:00,166 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 11:21:00,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:21:00,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:21:00,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:21:00,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:21:00,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:21:00,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:21:00,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:21:00,169 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 11:21:00,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:21:00,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:21:00,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:21:00,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:21:00,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:21:00,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:21:00,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:21:00,172 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 11:21:00,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:21:00,172 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:21:00,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:21:00,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:21:00,173 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:21:00,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:21:00,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:21:00,175 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 11:21:00,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:21:00,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:21:00,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:21:00,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:21:00,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:21:00,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:21:00,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:21:00,178 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 11:21:00,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:21:00,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:21:00,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:21:00,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:21:00,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:21:00,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:21:00,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:21:00,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:21:00,180 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 11:21:00,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:21:00,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:21:00,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:21:00,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:21:00,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:21:00,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:21:00,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:21:00,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:21:00,182 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 11:21:00,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:21:00,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:21:00,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:21:00,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:21:00,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:21:00,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:21:00,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:21:00,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:21:00,183 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 11:21:00,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:21:00,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:21:00,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:21:00,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:21:00,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:21:00,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:21:00,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:21:00,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:21:00,185 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 11:21:00,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:21:00,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:21:00,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:21:00,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:21:00,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:21:00,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:21:00,199 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:21:00,212 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:21:00,212 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 11:21:00,212 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:21:00,213 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:21:00,213 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:21:00,213 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_free_17_~i~1, ULTIMATE.start_free_17_~len) = -1*ULTIMATE.start_free_17_~i~1 + 1*ULTIMATE.start_free_17_~len Supporting invariants [] [2018-11-28 11:21:00,267 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 11:21:00,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:21:00,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:21:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:21:00,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:21:00,334 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 11:21:00,334 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 11:21:00,334 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 57 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 11:21:00,346 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 57 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 51 states and 60 transitions. Complement of second has 4 states. [2018-11-28 11:21:00,350 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 11:21:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:21:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-28 11:21:00,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 35 letters. Loop has 2 letters. [2018-11-28 11:21:00,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:21:00,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 37 letters. Loop has 2 letters. [2018-11-28 11:21:00,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:21:00,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 35 letters. Loop has 4 letters. [2018-11-28 11:21:00,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:21:00,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2018-11-28 11:21:00,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 11:21:00,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 43 transitions. [2018-11-28 11:21:00,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 11:21:00,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 11:21:00,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2018-11-28 11:21:00,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:21:00,353 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 11:21:00,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2018-11-28 11:21:00,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 11:21:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 11:21:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-28 11:21:00,356 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 11:21:00,356 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 11:21:00,356 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-28 11:21:00,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2018-11-28 11:21:00,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 11:21:00,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:21:00,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:21:00,357 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:21:00,357 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:21:00,358 INFO L794 eck$LassoCheckResult]: Stem: 2185#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); 2177#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 2178#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; 2179#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 2180#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2187#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2190#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2191#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2188#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2189#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2207#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2206#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2205#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2204#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2203#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2202#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2201#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2200#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2199#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2198#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2197#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2196#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2195#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2194#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2193#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2192#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2169#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 2170#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 2175#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2183#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 2184#L1445 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 2173#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 2174#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 2176#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2181#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 2182#L1445 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2171#L1445-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2172#L1450-3 [2018-11-28 11:21:00,358 INFO L796 eck$LassoCheckResult]: Loop: 2172#L1450-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 2186#L1450-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 2172#L1450-3 [2018-11-28 11:21:00,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:00,358 INFO L82 PathProgramCache]: Analyzing trace with hash -14863959, now seen corresponding path program 1 times [2018-11-28 11:21:00,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:00,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:00,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:00,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:00,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:21:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-28 11:21:00,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:21:00,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:21:00,420 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:21:00,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:00,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 2 times [2018-11-28 11:21:00,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:00,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:00,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:00,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:00,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:00,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:21:00,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:21:00,532 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-28 11:21:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:21:00,554 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-28 11:21:00,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:21:00,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 49 transitions. [2018-11-28 11:21:00,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 11:21:00,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 47 transitions. [2018-11-28 11:21:00,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 11:21:00,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 11:21:00,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 47 transitions. [2018-11-28 11:21:00,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:21:00,557 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-28 11:21:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 47 transitions. [2018-11-28 11:21:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-11-28 11:21:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 11:21:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-28 11:21:00,558 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-28 11:21:00,558 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-28 11:21:00,558 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-28 11:21:00,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2018-11-28 11:21:00,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 11:21:00,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:21:00,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:21:00,559 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:21:00,559 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:21:00,559 INFO L794 eck$LassoCheckResult]: Stem: 2279#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); 2271#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;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; 2272#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; 2273#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 2274#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2281#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2282#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2283#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2284#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2301#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2300#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2299#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2298#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2297#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2296#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2295#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2294#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2293#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2292#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2291#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2290#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2289#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2288#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2287#L1469-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2286#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2285#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2263#L1469-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 2264#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 2269#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; 2277#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 2278#L1445 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 2267#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 2268#L1443-3 assume !!(alloc_17_~i~0 < alloc_17_~len);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; 2270#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2275#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 2276#L1445 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2265#L1445-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2266#L1450-3 [2018-11-28 11:21:00,559 INFO L796 eck$LassoCheckResult]: Loop: 2266#L1450-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 2280#L1450-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 2266#L1450-3 [2018-11-28 11:21:00,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:00,560 INFO L82 PathProgramCache]: Analyzing trace with hash -694922329, now seen corresponding path program 1 times [2018-11-28 11:21:00,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:00,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:00,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:00,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:21:00,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:00,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:00,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 3 times [2018-11-28 11:21:00,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:00,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:00,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:00,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:00,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:00,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:00,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2100425303, now seen corresponding path program 1 times [2018-11-28 11:21:00,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:00,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:00,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:00,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:21:00,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:36,370 WARN L180 SmtUtils]: Spent 2.59 m on a formula simplification. DAG size of input: 431 DAG size of output: 369 [2018-11-28 11:23:36,386 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:36,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:43,157 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:43,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:49,400 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:49,460 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:54,659 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:54,726 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:58,915 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:58,958 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:24:02,280 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:24:02,315 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:24:05,094 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:24:05,120 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:24:06,875 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:24:06,894 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:24:07,863 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:24:07,876 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:24:08,636 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:24:08,650 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:24:09,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 10 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-11-28 11:24:09,207 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 11 variables, input treesize:612, output treesize:532 [2018-11-28 11:24:09,831 WARN L180 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2018-11-28 11:24:09,834 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:24:09,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:24:09,834 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:24:09,835 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:24:09,835 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:24:09,835 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:24:09,835 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:24:09,835 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:24:09,835 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1_true-valid-memsafety_true-termination.i_Iteration18_Lasso [2018-11-28 11:24:09,835 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:24:09,835 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:24:09,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:24:09,842 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 11:24:09,843 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 11:24:09,844 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 11:24:09,845 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 11:24:09,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:24:09,848 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 11:24:09,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:24:09,853 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 11:24:09,856 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 11:24:09,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:24:09,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:24:09,861 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 11:24:09,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:24:09,864 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 11:24:09,866 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 11:24:09,867 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 11:24:09,868 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 11:24:09,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:24:09,871 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 11:24:09,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:24:10,234 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 11:24:10,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:24:10,237 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 11:24:10,239 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 11:24:10,586 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:24:10,586 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:24:10,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:24:10,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:24:10,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:24:10,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:24:10,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,588 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 11:24:10,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:24:10,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:24:10,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:24:10,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,589 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 11:24:10,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:24:10,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:24:10,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:24:10,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,590 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 11:24:10,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:24:10,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:24:10,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:24:10,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,591 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 11:24:10,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:24:10,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:24:10,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:24:10,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:24:10,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:24:10,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:24:10,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:24:10,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:24:10,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,597 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 11:24:10,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:24:10,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:24:10,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,600 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 11:24:10,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:24:10,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:24:10,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,602 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 11:24:10,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:24:10,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:24:10,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,605 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 11:24:10,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:24:10,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:24:10,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:24:10,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,607 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 11:24:10,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:24:10,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:24:10,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:24:10,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,609 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 11:24:10,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:24:10,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:24:10,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,612 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 11:24:10,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:24:10,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:24:10,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:24:10,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:24:10,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:24:10,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:24:10,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,616 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 11:24:10,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:24:10,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:24:10,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:24:10,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,618 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 11:24:10,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:24:10,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:24:10,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:24:10,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,620 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 11:24:10,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:24:10,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:24:10,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:24:10,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,622 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 11:24:10,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:24:10,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:24:10,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:24:10,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:24:10,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:24:10,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:24:10,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:24:10,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:24:10,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:24:10,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:24:10,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 11:24:10,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:24:10,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:24:10,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:24:10,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:24:10,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:24:10,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:24:10,641 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:24:10,647 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:24:10,648 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 11:24:10,648 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:24:10,649 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:24:10,649 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:24:10,649 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~j~0, v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_4) = 8*ULTIMATE.start_alloc_17_~j~0 + 1*v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_4 Supporting invariants [] [2018-11-28 11:24:10,746 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 11:24:10,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:24:10,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:24:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:24:10,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:24:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:24:10,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:24:10,807 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 11:24:10,808 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 11:24:10,808 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 11:24:10,828 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 41 states and 45 transitions. Complement of second has 5 states. [2018-11-28 11:24:10,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:24:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:24:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-28 11:24:10,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 37 letters. Loop has 2 letters. [2018-11-28 11:24:10,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:24:10,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 39 letters. Loop has 2 letters. [2018-11-28 11:24:10,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:24:10,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 37 letters. Loop has 4 letters. [2018-11-28 11:24:10,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:24:10,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2018-11-28 11:24:10,831 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:24:10,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-28 11:24:10,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:24:10,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:24:10,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:24:10,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:24:10,831 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:24:10,831 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:24:10,831 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:24:10,831 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-28 11:24:10,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:24:10,831 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:24:10,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:24:10,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:24:10 BoogieIcfgContainer [2018-11-28 11:24:10,837 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:24:10,837 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:24:10,838 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:24:10,838 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:24:10,838 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:16:39" (3/4) ... [2018-11-28 11:24:10,841 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:24:10,841 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:24:10,841 INFO L168 Benchmark]: Toolchain (without parser) took 451977.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 257.4 MB). Free memory was 954.9 MB in the beginning and 821.7 MB in the end (delta: 133.2 MB). Peak memory consumption was 390.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:24:10,842 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:24:10,843 INFO L168 Benchmark]: CACSL2BoogieTranslator took 515.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:24:10,843 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.39 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:24:10,844 INFO L168 Benchmark]: Boogie Preprocessor took 27.96 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 11:24:10,844 INFO L168 Benchmark]: RCFGBuilder took 375.61 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.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:24:10,845 INFO L168 Benchmark]: BuchiAutomizer took 451001.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.2 MB). Free memory was 1.1 GB in the beginning and 821.7 MB in the end (delta: 272.3 MB). Peak memory consumption was 374.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:24:10,845 INFO L168 Benchmark]: Witness Printer took 3.36 ms. Allocated memory is still 1.3 GB. Free memory is still 821.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:24:10,848 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 515.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.39 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.96 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. * RCFGBuilder took 375.61 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.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 451001.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.2 MB). Free memory was 1.1 GB in the beginning and 821.7 MB in the end (delta: 272.3 MB). Peak memory consumption was 374.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.36 ms. Allocated memory is still 1.3 GB. Free memory is still 821.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 18 terminating modules (14 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * array + -4 * i + unknown-#length-unknown[array] and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 3 locations. One deterministic module has affine ranking function 8 * j + unknown-#length-unknown[array] and consists of 4 locations. 14 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 450.9s and 19 iterations. TraceHistogramMax:10. Analysis of lassos took 449.7s. Construction of modules took 0.4s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 68 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 15. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 400 SDtfs, 530 SDslu, 1102 SDs, 0 SdLazy, 516 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU13 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital466 mio100 ax107 hnf100 lsp88 ukn38 mio100 lsp57 div100 bol100 ite100 ukn100 eq186 hnf88 smp92 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 5 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...