./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/bin/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 ba3b14ef0de39694a8a8eb7210506a4804ce5885 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:17:25,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:17:25,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:17:25,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:17:25,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:17:25,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:17:25,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:17:25,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:17:25,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:17:25,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:17:25,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:17:25,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:17:25,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:17:25,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:17:25,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:17:25,163 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:17:25,164 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:17:25,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:17:25,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:17:25,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:17:25,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:17:25,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:17:25,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:17:25,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:17:25,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:17:25,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:17:25,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:17:25,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:17:25,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:17:25,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:17:25,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:17:25,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:17:25,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:17:25,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:17:25,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:17:25,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:17:25,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:17:25,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:17:25,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:17:25,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:17:25,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:17:25,204 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:17:25,238 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:17:25,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:17:25,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:17:25,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:17:25,241 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:17:25,241 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:17:25,241 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:17:25,242 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:17:25,242 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:17:25,242 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:17:25,243 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:17:25,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:17:25,243 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:17:25,244 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:17:25,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:17:25,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:17:25,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:17:25,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:17:25,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:17:25,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:17:25,246 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:17:25,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:17:25,246 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:17:25,246 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:17:25,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:17:25,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:17:25,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:17:25,248 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:17:25,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:17:25,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:17:25,249 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:17:25,250 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:17:25,250 INFO L138 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/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/bin/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 -> ba3b14ef0de39694a8a8eb7210506a4804ce5885 [2019-11-15 22:17:25,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:17:25,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:17:25,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:17:25,304 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:17:25,304 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:17:25,305 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2019-11-15 22:17:25,370 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/bin/uautomizer/data/39ae14ead/07dd85efaf1c4fb1b7933fc4c22b7d2d/FLAG34440f313 [2019-11-15 22:17:25,891 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:17:25,892 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2019-11-15 22:17:25,910 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/bin/uautomizer/data/39ae14ead/07dd85efaf1c4fb1b7933fc4c22b7d2d/FLAG34440f313 [2019-11-15 22:17:26,242 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/bin/uautomizer/data/39ae14ead/07dd85efaf1c4fb1b7933fc4c22b7d2d [2019-11-15 22:17:26,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:17:26,247 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:17:26,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:17:26,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:17:26,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:17:26,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:17:26" (1/1) ... [2019-11-15 22:17:26,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142f7e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:26, skipping insertion in model container [2019-11-15 22:17:26,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:17:26" (1/1) ... [2019-11-15 22:17:26,263 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:17:26,330 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:17:26,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:17:26,903 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:17:27,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:17:27,101 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:17:27,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:27 WrapperNode [2019-11-15 22:17:27,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:17:27,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:17:27,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:17:27,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:17:27,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:27" (1/1) ... [2019-11-15 22:17:27,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:27" (1/1) ... [2019-11-15 22:17:27,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:17:27,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:17:27,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:17:27,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:17:27,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:27" (1/1) ... [2019-11-15 22:17:27,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:27" (1/1) ... [2019-11-15 22:17:27,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:27" (1/1) ... [2019-11-15 22:17:27,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:27" (1/1) ... [2019-11-15 22:17:27,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:27" (1/1) ... [2019-11-15 22:17:27,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:27" (1/1) ... [2019-11-15 22:17:27,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:27" (1/1) ... [2019-11-15 22:17:27,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:17:27,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:17:27,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:17:27,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:17:27,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/bin/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 [2019-11-15 22:17:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:17:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:17:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:17:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:17:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:17:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 22:17:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:17:27,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:17:27,735 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:17:27,736 INFO L284 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-15 22:17:27,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:17:27 BoogieIcfgContainer [2019-11-15 22:17:27,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:17:27,738 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:17:27,738 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:17:27,742 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:17:27,743 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:17:27,743 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:17:26" (1/3) ... [2019-11-15 22:17:27,744 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c4fb504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:17:27, skipping insertion in model container [2019-11-15 22:17:27,744 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:17:27,745 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:27" (2/3) ... [2019-11-15 22:17:27,745 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c4fb504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:17:27, skipping insertion in model container [2019-11-15 22:17:27,745 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:17:27,745 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:17:27" (3/3) ... [2019-11-15 22:17:27,747 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_1.i [2019-11-15 22:17:27,816 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:17:27,817 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:17:27,817 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:17:27,817 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:17:27,817 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:17:27,818 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:17:27,818 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:17:27,818 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:17:27,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 22:17:27,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:17:27,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:17:27,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:17:27,874 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:17:27,874 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:17:27,874 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:17:27,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 22:17:27,878 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:17:27,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:17:27,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:17:27,879 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:17:27,879 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:17:27,885 INFO L791 eck$LassoCheckResult]: Stem: 11#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.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 9#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;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; 17#L527true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 13#L530true entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 8#L767true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 12#L768-3true [2019-11-15 22:17:27,886 INFO L793 eck$LassoCheckResult]: Loop: 12#L768-3true assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 4#L527-1true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 15#L530-1true entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 7#L770true assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 10#L768-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 12#L768-3true [2019-11-15 22:17:27,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:27,893 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-15 22:17:27,902 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:27,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219488904] [2019-11-15 22:17:27,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:27,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:27,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:17:28,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219488904] [2019-11-15 22:17:28,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:17:28,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:17:28,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295981475] [2019-11-15 22:17:28,166 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:17:28,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:28,167 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2019-11-15 22:17:28,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:28,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023507066] [2019-11-15 22:17:28,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:28,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:28,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:28,228 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:17:28,555 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-15 22:17:28,696 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 22:17:28,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:17:28,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:17:28,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:17:28,719 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2019-11-15 22:17:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:28,802 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-11-15 22:17:28,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:17:28,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-11-15 22:17:28,808 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-15 22:17:28,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 25 transitions. [2019-11-15 22:17:28,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:17:28,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:17:28,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2019-11-15 22:17:28,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:17:28,816 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-15 22:17:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2019-11-15 22:17:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2019-11-15 22:17:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 22:17:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-11-15 22:17:28,857 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-15 22:17:28,857 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-15 22:17:28,857 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:17:28,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-11-15 22:17:28,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:17:28,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:17:28,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:17:28,860 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:17:28,861 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:17:28,861 INFO L791 eck$LassoCheckResult]: Stem: 68#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.allocOnStack(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); 66#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;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; 67#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 69#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 64#L767 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 65#L768-3 [2019-11-15 22:17:28,861 INFO L793 eck$LassoCheckResult]: Loop: 65#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 59#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 60#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 61#L770 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 63#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 65#L768-3 [2019-11-15 22:17:28,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:28,862 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2019-11-15 22:17:28,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:28,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671966748] [2019-11-15 22:17:28,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:28,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:28,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:28,922 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:17:28,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:28,923 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2019-11-15 22:17:28,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:28,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831088348] [2019-11-15 22:17:28,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:28,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:28,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:28,978 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:17:28,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:28,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2019-11-15 22:17:28,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:28,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257783973] [2019-11-15 22:17:28,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:28,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:28,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:29,075 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:17:29,325 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-15 22:17:29,441 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 22:17:29,746 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-11-15 22:17:29,883 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 22:17:29,899 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:17:29,901 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:17:29,902 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:17:29,903 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:17:29,903 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:17:29,903 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:17:29,903 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:17:29,904 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:17:29,904 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1.i_Iteration2_Lasso [2019-11-15 22:17:29,904 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:17:29,904 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:17:29,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:29,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:29,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:29,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:29,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:29,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:29,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:29,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:29,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:29,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:30,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:30,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:30,378 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-15 22:17:30,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:30,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:30,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:30,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:30,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:30,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:31,044 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-15 22:17:31,427 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-11-15 22:17:31,561 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:17:31,572 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:17:31,575 INFO L120 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 [2019-11-15 22:17:31,576 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:31,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:31,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:31,578 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:31,585 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:17:31,585 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:17:31,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:31,596 INFO L120 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 [2019-11-15 22:17:31,597 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:31,597 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:31,598 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:31,598 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:31,598 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:31,599 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:31,600 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:31,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:31,602 INFO L120 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 [2019-11-15 22:17:31,602 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:31,602 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:31,603 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:31,603 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:31,604 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:31,605 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:31,605 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:31,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:31,616 INFO L120 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 [2019-11-15 22:17:31,617 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:31,617 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:31,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:31,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:31,618 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:31,619 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:31,619 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:31,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:31,625 INFO L120 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 [2019-11-15 22:17:31,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:31,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:31,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:31,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:31,628 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:17:31,628 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:17:31,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:31,636 INFO L120 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 [2019-11-15 22:17:31,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:31,638 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:31,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:31,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:31,639 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:31,642 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:31,642 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:31,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:31,644 INFO L120 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 [2019-11-15 22:17:31,645 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:31,645 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:31,646 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:31,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:31,646 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:31,647 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:31,647 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:31,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:31,651 INFO L120 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 [2019-11-15 22:17:31,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:31,653 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:31,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:31,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:31,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:31,654 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:31,654 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:31,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:31,658 INFO L120 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 [2019-11-15 22:17:31,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:31,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:31,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:31,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:31,665 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:17:31,665 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:17:31,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:31,679 INFO L120 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 [2019-11-15 22:17:31,680 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:31,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:31,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:31,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:31,682 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:17:31,682 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:17:31,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:31,694 INFO L120 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 [2019-11-15 22:17:31,695 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:31,695 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:31,695 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:31,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:31,696 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:31,696 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:31,697 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:31,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:31,698 INFO L120 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 [2019-11-15 22:17:31,699 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:31,699 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:31,700 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:31,700 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:31,711 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:17:31,711 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:17:31,858 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:17:31,954 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 22:17:31,955 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 22:17:31,957 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:17:31,959 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:17:31,959 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:17:31,960 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~0) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~0 Supporting invariants [] [2019-11-15 22:17:31,980 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-15 22:17:32,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:32,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:17:32,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:17:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:32,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:17:32,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:17:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:17:32,069 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 [2019-11-15 22:17:32,070 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 22:17:32,116 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 27 states and 36 transitions. Complement of second has 6 states. [2019-11-15 22:17:32,117 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 [2019-11-15 22:17:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:17:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-11-15 22:17:32,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 5 letters. [2019-11-15 22:17:32,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:17:32,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-15 22:17:32,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:17:32,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-15 22:17:32,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:17:32,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-11-15 22:17:32,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:17:32,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 26 transitions. [2019-11-15 22:17:32,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 22:17:32,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 22:17:32,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-11-15 22:17:32,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:17:32,125 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-15 22:17:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-11-15 22:17:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-11-15 22:17:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 22:17:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-15 22:17:32,127 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 22:17:32,128 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 22:17:32,128 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:17:32,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-15 22:17:32,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:17:32,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:17:32,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:17:32,129 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:17:32,129 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:17:32,130 INFO L791 eck$LassoCheckResult]: Stem: 185#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.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 182#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 183#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 186#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 180#L767 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 181#L768-3 assume !(entry_point_~i~0 < entry_point_~len~0); 177#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 171#L774-3 [2019-11-15 22:17:32,130 INFO L793 eck$LassoCheckResult]: Loop: 171#L774-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 170#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 171#L774-3 [2019-11-15 22:17:32,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:32,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1804968475, now seen corresponding path program 1 times [2019-11-15 22:17:32,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:32,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569662054] [2019-11-15 22:17:32,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:17:32,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569662054] [2019-11-15 22:17:32,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:17:32,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:17:32,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175460151] [2019-11-15 22:17:32,171 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:17:32,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:32,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 1 times [2019-11-15 22:17:32,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:32,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657992367] [2019-11-15 22:17:32,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,181 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:17:32,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:17:32,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:17:32,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:17:32,225 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-15 22:17:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:32,253 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-11-15 22:17:32,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:17:32,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-11-15 22:17:32,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:17:32,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2019-11-15 22:17:32,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 22:17:32,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 22:17:32,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-11-15 22:17:32,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:17:32,258 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-15 22:17:32,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-11-15 22:17:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-11-15 22:17:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 22:17:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-11-15 22:17:32,260 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-15 22:17:32,260 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-15 22:17:32,261 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:17:32,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2019-11-15 22:17:32,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:17:32,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:17:32,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:17:32,267 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:17:32,267 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:17:32,269 INFO L791 eck$LassoCheckResult]: Stem: 236#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.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 233#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 234#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 237#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 231#L767 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 232#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 223#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 224#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 227#L770 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 228#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 222#L774-3 [2019-11-15 22:17:32,274 INFO L793 eck$LassoCheckResult]: Loop: 222#L774-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 221#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 222#L774-3 [2019-11-15 22:17:32,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:32,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1173218535, now seen corresponding path program 1 times [2019-11-15 22:17:32,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:32,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358276026] [2019-11-15 22:17:32,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,317 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:17:32,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:32,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 2 times [2019-11-15 22:17:32,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:32,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476441382] [2019-11-15 22:17:32,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,338 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:17:32,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:32,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2113388251, now seen corresponding path program 1 times [2019-11-15 22:17:32,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:32,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33141462] [2019-11-15 22:17:32,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:17:32,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33141462] [2019-11-15 22:17:32,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:17:32,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:17:32,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493311288] [2019-11-15 22:17:32,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:17:32,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:17:32,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:17:32,439 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-15 22:17:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:32,479 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-11-15 22:17:32,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:17:32,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2019-11-15 22:17:32,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:17:32,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2019-11-15 22:17:32,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 22:17:32,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 22:17:32,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2019-11-15 22:17:32,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:17:32,483 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-15 22:17:32,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2019-11-15 22:17:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-11-15 22:17:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 22:17:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-15 22:17:32,486 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-15 22:17:32,486 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-15 22:17:32,486 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:17:32,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-11-15 22:17:32,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:17:32,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:17:32,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:17:32,487 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:17:32,488 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:17:32,488 INFO L791 eck$LassoCheckResult]: Stem: 290#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.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 287#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 288#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 291#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 285#L767 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 286#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 279#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 280#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 283#L770 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 284#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 289#L768-3 assume !(entry_point_~i~0 < entry_point_~len~0); 282#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 276#L774-3 [2019-11-15 22:17:32,488 INFO L793 eck$LassoCheckResult]: Loop: 276#L774-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 275#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 276#L774-3 [2019-11-15 22:17:32,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:32,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2113443111, now seen corresponding path program 1 times [2019-11-15 22:17:32,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:32,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549942228] [2019-11-15 22:17:32,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:17:32,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549942228] [2019-11-15 22:17:32,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:17:32,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:17:32,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057063509] [2019-11-15 22:17:32,524 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:17:32,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:32,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 3 times [2019-11-15 22:17:32,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:32,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660098370] [2019-11-15 22:17:32,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,532 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:17:32,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:17:32,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:17:32,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:17:32,568 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-15 22:17:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:32,608 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-11-15 22:17:32,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:17:32,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2019-11-15 22:17:32,610 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:17:32,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2019-11-15 22:17:32,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:17:32,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:17:32,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2019-11-15 22:17:32,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:17:32,611 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-15 22:17:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2019-11-15 22:17:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-15 22:17:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 22:17:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-15 22:17:32,614 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 22:17:32,614 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 22:17:32,614 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:17:32,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-15 22:17:32,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:17:32,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:17:32,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:17:32,616 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:17:32,616 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:17:32,616 INFO L791 eck$LassoCheckResult]: Stem: 343#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.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 340#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 341#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 344#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 338#L767 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 339#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 332#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 333#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 336#L770 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 337#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 342#L768-3 assume !(entry_point_~i~0 < entry_point_~len~0); 335#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 329#L774-3 [2019-11-15 22:17:32,616 INFO L793 eck$LassoCheckResult]: Loop: 329#L774-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 328#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 329#L774-3 [2019-11-15 22:17:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:32,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2056184809, now seen corresponding path program 1 times [2019-11-15 22:17:32,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:32,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098506306] [2019-11-15 22:17:32,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:17:32,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098506306] [2019-11-15 22:17:32,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884889550] [2019-11-15 22:17:32,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bb67b22a-b5c2-4b51-82ed-acc7bd7c3d52/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:17:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:32,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:17:32,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:17:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:17:32,804 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:17:32,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-15 22:17:32,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447329902] [2019-11-15 22:17:32,805 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:17:32,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:32,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 4 times [2019-11-15 22:17:32,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:32,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043834751] [2019-11-15 22:17:32,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,814 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:17:32,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:17:32,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:17:32,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:17:32,856 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-15 22:17:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:32,896 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-11-15 22:17:32,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:17:32,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-11-15 22:17:32,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:17:32,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2019-11-15 22:17:32,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 22:17:32,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 22:17:32,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2019-11-15 22:17:32,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:17:32,899 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-15 22:17:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2019-11-15 22:17:32,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2019-11-15 22:17:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 22:17:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-15 22:17:32,902 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-15 22:17:32,902 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-15 22:17:32,902 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:17:32,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2019-11-15 22:17:32,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:17:32,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:17:32,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:17:32,903 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:17:32,903 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:17:32,904 INFO L791 eck$LassoCheckResult]: Stem: 435#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.allocOnStack(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); 432#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;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; 433#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 437#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 430#L767 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 431#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 436#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 438#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 428#L770 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 429#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 434#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 422#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 423#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 426#L770 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 427#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 421#L774-3 [2019-11-15 22:17:32,904 INFO L793 eck$LassoCheckResult]: Loop: 421#L774-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 420#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 421#L774-3 [2019-11-15 22:17:32,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:32,904 INFO L82 PathProgramCache]: Analyzing trace with hash 979558027, now seen corresponding path program 1 times [2019-11-15 22:17:32,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:32,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632473792] [2019-11-15 22:17:32,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,933 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:17:32,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:32,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 5 times [2019-11-15 22:17:32,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:32,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041776307] [2019-11-15 22:17:32,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,941 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:17:32,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:32,942 INFO L82 PathProgramCache]: Analyzing trace with hash 757427661, now seen corresponding path program 1 times [2019-11-15 22:17:32,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:32,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476319352] [2019-11-15 22:17:32,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:32,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:17:32,978 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:17:33,720 WARN L191 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 145 [2019-11-15 22:17:33,890 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-15 22:17:33,892 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:17:33,892 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:17:33,892 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:17:33,892 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:17:33,893 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:17:33,893 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:17:33,893 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:17:33,893 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:17:33,893 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1.i_Iteration7_Lasso [2019-11-15 22:17:33,893 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:17:33,893 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:17:33,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:33,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:34,192 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-15 22:17:34,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:34,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:34,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:34,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:34,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:17:34,881 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-15 22:17:34,936 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:17:34,937 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:17:34,937 INFO L120 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 [2019-11-15 22:17:34,938 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,938 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,938 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,939 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,940 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:17:34,940 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:17:34,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,943 INFO L120 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 [2019-11-15 22:17:34,944 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,944 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:34,944 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,945 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,945 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,945 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:34,945 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:34,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,946 INFO L120 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 [2019-11-15 22:17:34,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,947 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,947 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,948 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:17:34,949 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:17:34,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,951 INFO L120 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 [2019-11-15 22:17:34,952 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,952 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,952 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,952 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,953 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:17:34,953 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:17:34,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,955 INFO L120 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 [2019-11-15 22:17:34,956 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,956 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:34,956 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,957 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,957 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,957 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:34,957 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:34,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,958 INFO L120 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 [2019-11-15 22:17:34,959 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,959 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,959 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,960 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,961 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:17:34,961 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:17:34,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,964 INFO L120 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 [2019-11-15 22:17:34,964 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,965 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:34,965 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,965 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,965 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,966 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:34,966 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:34,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,967 INFO L120 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 [2019-11-15 22:17:34,967 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,968 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:34,968 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,968 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,968 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,969 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:34,969 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:34,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,971 INFO L120 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 [2019-11-15 22:17:34,971 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,971 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:34,972 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,972 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,972 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,972 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:34,973 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:34,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,974 INFO L120 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 [2019-11-15 22:17:34,974 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,975 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:34,975 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,975 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,975 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,976 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:34,976 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:34,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,977 INFO L120 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 [2019-11-15 22:17:34,978 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,978 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,978 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,978 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,979 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:17:34,979 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:17:34,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,982 INFO L120 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 [2019-11-15 22:17:34,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,983 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:34,983 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,983 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,984 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,984 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:34,984 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:34,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,985 INFO L120 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 [2019-11-15 22:17:34,986 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,986 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,986 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,987 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,988 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:17:34,988 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:17:34,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,990 INFO L120 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 [2019-11-15 22:17:34,991 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,991 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,991 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,992 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:17:34,993 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:17:34,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,995 INFO L120 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 [2019-11-15 22:17:34,996 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,996 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:34,996 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:34,996 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:34,997 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:34,997 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:34,997 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:34,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:34,998 INFO L120 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 [2019-11-15 22:17:34,999 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:34,999 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:34,999 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:35,000 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:35,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:35,000 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:35,000 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:35,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:35,002 INFO L120 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 [2019-11-15 22:17:35,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:35,002 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:35,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:35,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:35,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:35,003 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:35,004 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:35,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:35,005 INFO L120 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 [2019-11-15 22:17:35,006 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:35,006 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:17:35,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:35,006 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:35,006 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:35,007 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:17:35,007 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:17:35,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:17:35,008 INFO L120 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 [2019-11-15 22:17:35,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:17:35,009 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:17:35,009 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:17:35,009 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:17:35,012 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:17:35,012 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:17:35,029 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:17:35,035 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:17:35,035 INFO L444 ModelExtractionUtils]: 19 out of 22 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 22:17:35,036 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:17:35,037 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:17:35,037 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:17:35,037 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0) = 2*ULTIMATE.start_entry_point_~j~0 + 1 Supporting invariants [] [2019-11-15 22:17:35,055 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 22:17:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:35,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:17:35,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:17:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:35,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:17:35,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:17:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:17:35,129 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 [2019-11-15 22:17:35,129 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 22:17:35,144 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2019-11-15 22:17:35,144 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 [2019-11-15 22:17:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:17:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-15 22:17:35,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-15 22:17:35,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:17:35,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-15 22:17:35,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:17:35,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 22:17:35,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:17:35,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-15 22:17:35,147 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:17:35,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-11-15 22:17:35,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:17:35,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:17:35,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:17:35,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:17:35,148 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:17:35,148 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:17:35,148 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:17:35,148 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 22:17:35,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:17:35,149 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:17:35,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:17:35,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:17:35 BoogieIcfgContainer [2019-11-15 22:17:35,156 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:17:35,156 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:17:35,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:17:35,157 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:17:35,157 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:17:27" (3/4) ... [2019-11-15 22:17:35,161 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:17:35,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:17:35,163 INFO L168 Benchmark]: Toolchain (without parser) took 8916.33 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.0 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -292.9 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:17:35,164 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:17:35,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 856.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:17:35,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.56 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:17:35,165 INFO L168 Benchmark]: Boogie Preprocessor took 77.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:17:35,166 INFO L168 Benchmark]: RCFGBuilder took 460.87 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: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:17:35,167 INFO L168 Benchmark]: BuchiAutomizer took 7418.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -171.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:17:35,167 INFO L168 Benchmark]: Witness Printer took 4.77 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:17:35,171 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 856.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.56 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 460.87 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: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7418.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -171.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.77 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 4 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 42 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 113 SDtfs, 146 SDslu, 108 SDs, 0 SdLazy, 92 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital256 mio100 ax111 hnf101 lsp83 ukn56 mio100 lsp57 div100 bol100 ite100 ukn100 eq191 hnf90 smp100 dnf190 smp66 tf100 neg94 sie124 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...