./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/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/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-10-22 08:57:22,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:22,849 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:22,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:22,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:22,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:22,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:22,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:22,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:22,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:22,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:22,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:22,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:22,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:22,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:22,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:22,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:22,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:22,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:22,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:22,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:22,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:22,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:22,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:22,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:22,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:22,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:22,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:22,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:22,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:22,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:22,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:22,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:22,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:22,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:22,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:22,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:22,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:22,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:22,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:22,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:22,894 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:57:22,913 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:22,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:22,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:22,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:22,920 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:22,920 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:22,920 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:22,920 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:22,920 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:22,920 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:22,921 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:22,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:22,921 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:22,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:22,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:22,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:22,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:22,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:22,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:22,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:22,922 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:22,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:22,922 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:22,923 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:22,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:22,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:22,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:22,923 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:22,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:22,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:22,924 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:22,924 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:22,925 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/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/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-10-22 08:57:22,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:22,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:22,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:22,968 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:22,968 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:22,969 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2019-10-22 08:57:23,018 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/bin/uautomizer/data/2e6f81532/1a845482306f4d44b1f8b55b6462ff6b/FLAG059d44742 [2019-10-22 08:57:23,441 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:23,442 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2019-10-22 08:57:23,456 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/bin/uautomizer/data/2e6f81532/1a845482306f4d44b1f8b55b6462ff6b/FLAG059d44742 [2019-10-22 08:57:23,469 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/bin/uautomizer/data/2e6f81532/1a845482306f4d44b1f8b55b6462ff6b [2019-10-22 08:57:23,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:23,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:23,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:23,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:23,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:23,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:23" (1/1) ... [2019-10-22 08:57:23,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2785b9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:23, skipping insertion in model container [2019-10-22 08:57:23,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:23" (1/1) ... [2019-10-22 08:57:23,485 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:23,523 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:23,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:24,016 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:24,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:24,142 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:24,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24 WrapperNode [2019-10-22 08:57:24,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:24,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:24,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:24,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:24,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:24,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:24,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:24,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:24,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:24,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:24,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:24,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:24,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:24,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:24,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:24,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:24,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... [2019-10-22 08:57:24,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:24,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:24,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:24,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:24,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/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-10-22 08:57:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:57:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:57:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:57:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 08:57:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:24,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:24,591 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:24,591 INFO L284 CfgBuilder]: Removed 12 assume(true) statements. [2019-10-22 08:57:24,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:24 BoogieIcfgContainer [2019-10-22 08:57:24,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:24,593 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:24,593 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:24,597 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:24,598 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:24,598 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:23" (1/3) ... [2019-10-22 08:57:24,599 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ca0002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:24, skipping insertion in model container [2019-10-22 08:57:24,599 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:24,599 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:24" (2/3) ... [2019-10-22 08:57:24,600 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ca0002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:24, skipping insertion in model container [2019-10-22 08:57:24,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:24,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:24" (3/3) ... [2019-10-22 08:57:24,602 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_1.i [2019-10-22 08:57:24,648 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:24,649 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:24,649 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:24,649 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:24,649 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:24,649 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:24,649 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:24,649 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:24,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:57:24,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:57:24,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:24,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:24,694 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:24,694 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:24,694 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:24,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:57:24,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:57:24,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:24,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:24,696 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:24,697 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:24,702 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-10-22 08:57:24,702 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-10-22 08:57:24,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:24,709 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-10-22 08:57:24,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:24,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619150371] [2019-10-22 08:57:24,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:24,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:24,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619150371] [2019-10-22 08:57:24,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:24,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:24,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407329172] [2019-10-22 08:57:24,896 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:24,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:24,896 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2019-10-22 08:57:24,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:24,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975936555] [2019-10-22 08:57:24,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:24,947 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:25,138 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-10-22 08:57:25,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:25,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:25,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:25,242 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2019-10-22 08:57:25,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:25,299 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-10-22 08:57:25,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:25,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-10-22 08:57:25,304 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-10-22 08:57:25,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 25 transitions. [2019-10-22 08:57:25,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 08:57:25,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 08:57:25,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2019-10-22 08:57:25,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:25,311 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-22 08:57:25,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2019-10-22 08:57:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2019-10-22 08:57:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:57:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-10-22 08:57:25,338 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-10-22 08:57:25,338 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-10-22 08:57:25,339 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:25,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-10-22 08:57:25,339 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:57:25,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:25,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:25,340 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:25,340 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:25,340 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-10-22 08:57:25,340 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-10-22 08:57:25,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:25,341 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2019-10-22 08:57:25,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:25,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323960220] [2019-10-22 08:57:25,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:25,391 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:25,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:25,392 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2019-10-22 08:57:25,392 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:25,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245749198] [2019-10-22 08:57:25,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:25,439 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:25,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:25,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2019-10-22 08:57:25,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:25,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273441862] [2019-10-22 08:57:25,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:25,517 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:25,728 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-10-22 08:57:26,047 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-10-22 08:57:26,158 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:26,159 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:26,159 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:26,159 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:26,159 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:26,160 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:26,160 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:26,160 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:26,160 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1.i_Iteration2_Lasso [2019-10-22 08:57:26,160 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:26,161 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:26,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,425 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-10-22 08:57:26,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,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-10-22 08:57:26,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-10-22 08:57:26,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,085 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-10-22 08:57:27,159 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:27,164 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:27,166 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-10-22 08:57:27,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,171 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:27,172 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:27,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,176 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-10-22 08:57:27,176 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,177 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:27,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,177 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,177 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,178 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:27,178 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:27,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,179 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-10-22 08:57:27,179 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,180 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:27,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,180 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:27,181 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:27,181 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,182 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-10-22 08:57:27,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,183 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:27,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,183 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,184 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:27,184 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:27,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,185 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-10-22 08:57:27,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,188 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:27,188 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:27,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,192 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-10-22 08:57:27,192 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:27,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,195 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,195 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,195 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:27,196 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:27,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,199 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-10-22 08:57:27,201 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,201 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:27,201 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,202 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:27,202 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:27,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,203 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-10-22 08:57:27,203 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,204 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:27,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,204 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,204 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,204 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:27,205 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:27,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,205 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-10-22 08:57:27,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,208 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,210 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:27,212 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:27,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,225 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-10-22 08:57:27,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,225 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,226 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,226 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,227 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:27,227 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:27,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,238 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-10-22 08:57:27,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,239 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:27,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,240 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:27,240 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:27,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,241 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-10-22 08:57:27,241 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,242 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,244 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,244 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,259 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:27,259 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:27,366 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:27,420 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:57:27,421 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 08:57:27,424 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:27,425 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:27,426 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:27,427 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-10-22 08:57:27,443 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 08:57:27,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:27,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:27,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:27,525 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-10-22 08:57:27,526 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:57:27,572 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-10-22 08:57:27,573 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-10-22 08:57:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-10-22 08:57:27,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 5 letters. [2019-10-22 08:57:27,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:27,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 5 letters. [2019-10-22 08:57:27,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:27,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:57:27,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:27,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-10-22 08:57:27,580 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:57:27,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 26 transitions. [2019-10-22 08:57:27,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:57:27,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 08:57:27,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-10-22 08:57:27,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:27,583 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-10-22 08:57:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-10-22 08:57:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-10-22 08:57:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:57:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-10-22 08:57:27,585 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 08:57:27,585 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 08:57:27,586 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:27,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-10-22 08:57:27,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:27,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:27,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:27,588 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:27,588 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:27,588 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-10-22 08:57:27,588 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-10-22 08:57:27,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1804968475, now seen corresponding path program 1 times [2019-10-22 08:57:27,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426850951] [2019-10-22 08:57:27,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:27,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426850951] [2019-10-22 08:57:27,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:27,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:27,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20549284] [2019-10-22 08:57:27,618 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:27,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 1 times [2019-10-22 08:57:27,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595233329] [2019-10-22 08:57:27,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:27,633 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:27,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:27,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:27,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:27,668 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:57:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:27,687 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-10-22 08:57:27,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:27,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-10-22 08:57:27,689 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:57:27,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2019-10-22 08:57:27,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 08:57:27,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 08:57:27,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-10-22 08:57:27,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:27,690 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-10-22 08:57:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-10-22 08:57:27,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-10-22 08:57:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:57:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-10-22 08:57:27,692 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-10-22 08:57:27,692 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-10-22 08:57:27,692 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:57:27,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2019-10-22 08:57:27,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:27,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:27,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:27,693 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:27,693 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:27,693 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-10-22 08:57:27,693 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-10-22 08:57:27,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1173218535, now seen corresponding path program 1 times [2019-10-22 08:57:27,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698469010] [2019-10-22 08:57:27,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:27,709 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 2 times [2019-10-22 08:57:27,710 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471622820] [2019-10-22 08:57:27,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:27,717 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:27,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2113388251, now seen corresponding path program 1 times [2019-10-22 08:57:27,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111921813] [2019-10-22 08:57:27,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:27,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111921813] [2019-10-22 08:57:27,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:27,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:27,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677177250] [2019-10-22 08:57:27,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:27,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:27,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:27,780 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 08:57:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:27,807 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-10-22 08:57:27,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:27,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2019-10-22 08:57:27,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:27,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2019-10-22 08:57:27,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:57:27,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:57:27,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2019-10-22 08:57:27,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:27,810 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-10-22 08:57:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2019-10-22 08:57:27,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-10-22 08:57:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:57:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-10-22 08:57:27,811 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-22 08:57:27,812 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-22 08:57:27,812 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:57:27,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-10-22 08:57:27,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:27,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:27,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:27,813 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:27,813 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:27,813 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-10-22 08:57:27,813 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-10-22 08:57:27,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2113443111, now seen corresponding path program 1 times [2019-10-22 08:57:27,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981160877] [2019-10-22 08:57:27,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:27,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981160877] [2019-10-22 08:57:27,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:27,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:27,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664582294] [2019-10-22 08:57:27,840 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:27,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 3 times [2019-10-22 08:57:27,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550967629] [2019-10-22 08:57:27,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:27,845 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:27,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:27,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:27,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:27,870 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-10-22 08:57:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:27,894 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-10-22 08:57:27,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:27,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2019-10-22 08:57:27,895 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:57:27,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2019-10-22 08:57:27,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 08:57:27,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 08:57:27,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2019-10-22 08:57:27,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:27,896 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-22 08:57:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2019-10-22 08:57:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-10-22 08:57:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:57:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-10-22 08:57:27,898 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:57:27,898 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:57:27,898 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:57:27,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-10-22 08:57:27,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:27,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:27,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:27,899 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:27,899 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:27,899 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-10-22 08:57:27,899 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-10-22 08:57:27,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,900 INFO L82 PathProgramCache]: Analyzing trace with hash 2056184809, now seen corresponding path program 1 times [2019-10-22 08:57:27,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328098642] [2019-10-22 08:57:27,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:27,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328098642] [2019-10-22 08:57:27,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106893090] [2019-10-22 08:57:27,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4368a0c6-7ae1-4a5e-8ce3-a751dfef303a/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-10-22 08:57:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:27,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:28,017 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:28,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-10-22 08:57:28,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74064582] [2019-10-22 08:57:28,018 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:28,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:28,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 4 times [2019-10-22 08:57:28,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:28,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078292412] [2019-10-22 08:57:28,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,028 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:28,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:28,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:57:28,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:28,052 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-10-22 08:57:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:28,077 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-10-22 08:57:28,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:28,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-10-22 08:57:28,078 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:57:28,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2019-10-22 08:57:28,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 08:57:28,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 08:57:28,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2019-10-22 08:57:28,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:28,079 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-10-22 08:57:28,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2019-10-22 08:57:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2019-10-22 08:57:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 08:57:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-22 08:57:28,081 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-22 08:57:28,081 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-22 08:57:28,081 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:57:28,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2019-10-22 08:57:28,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:28,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:28,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:28,083 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:28,083 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:28,083 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-10-22 08:57:28,083 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-10-22 08:57:28,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:28,083 INFO L82 PathProgramCache]: Analyzing trace with hash 979558027, now seen corresponding path program 1 times [2019-10-22 08:57:28,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:28,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566553782] [2019-10-22 08:57:28,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,111 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:28,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:28,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 5 times [2019-10-22 08:57:28,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:28,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718624383] [2019-10-22 08:57:28,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,126 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:28,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:28,127 INFO L82 PathProgramCache]: Analyzing trace with hash 757427661, now seen corresponding path program 1 times [2019-10-22 08:57:28,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:28,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752835439] [2019-10-22 08:57:28,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,152 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:28,697 WARN L191 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 145 [2019-10-22 08:57:28,823 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-10-22 08:57:28,824 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:28,824 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:28,824 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:28,824 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:28,824 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:28,824 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:28,824 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:28,825 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:28,825 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1.i_Iteration7_Lasso [2019-10-22 08:57:28,825 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:28,825 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:28,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:28,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,482 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-10-22 08:57:29,515 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:29,515 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:29,515 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-10-22 08:57:29,516 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,516 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,516 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,517 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,518 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:29,518 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:29,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,521 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-10-22 08:57:29,522 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,522 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,522 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,522 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,522 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,523 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,523 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,523 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-10-22 08:57:29,524 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,524 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,524 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,525 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:29,525 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:29,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,527 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-10-22 08:57:29,527 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,528 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,528 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,529 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:29,529 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:29,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,531 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-10-22 08:57:29,531 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,531 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,531 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,532 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,532 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,532 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,533 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-10-22 08:57:29,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,535 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:29,535 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:29,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,537 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-10-22 08:57:29,537 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,537 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,538 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,538 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,538 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,538 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,538 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,539 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-10-22 08:57:29,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,540 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,540 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,540 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,540 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,540 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,541 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-10-22 08:57:29,541 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,541 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,542 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,542 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,542 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,542 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,543 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,543 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-10-22 08:57:29,544 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,544 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,544 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,544 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,544 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,544 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,544 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,545 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-10-22 08:57:29,546 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,546 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,547 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:29,547 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:29,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,549 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-10-22 08:57:29,549 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,550 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,550 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,550 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,550 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,551 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,551 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,551 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-10-22 08:57:29,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,552 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,552 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,553 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:29,553 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:29,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,555 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-10-22 08:57:29,555 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,555 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,556 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:29,556 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:29,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,558 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-10-22 08:57:29,559 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,559 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,559 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,559 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,559 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,559 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,560 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,560 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-10-22 08:57:29,561 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,561 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,561 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,561 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,561 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,561 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,561 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,563 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-10-22 08:57:29,563 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,563 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,564 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,564 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,564 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,564 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,565 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-10-22 08:57:29,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,565 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:29,566 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,566 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,566 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,566 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:29,567 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:29,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:29,567 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-10-22 08:57:29,568 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:29,568 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:29,568 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:29,568 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:29,570 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:29,571 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:29,584 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:29,588 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:57:29,588 INFO L444 ModelExtractionUtils]: 19 out of 22 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:57:29,589 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:29,590 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:29,590 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:29,590 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-10-22 08:57:29,610 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:57:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:29,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:29,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:29,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:29,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:29,661 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-10-22 08:57:29,661 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:57:29,672 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-10-22 08:57:29,673 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-10-22 08:57:29,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 08:57:29,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-10-22 08:57:29,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:29,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-10-22 08:57:29,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:29,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 08:57:29,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:29,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-10-22 08:57:29,675 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:29,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-10-22 08:57:29,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:57:29,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:57:29,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:57:29,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:29,675 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:29,676 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:29,676 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:29,676 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:57:29,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:29,676 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:29,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:57:29,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:57:29 BoogieIcfgContainer [2019-10-22 08:57:29,685 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:57:29,686 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:29,686 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:29,686 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:29,686 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:24" (3/4) ... [2019-10-22 08:57:29,690 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:57:29,690 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:29,692 INFO L168 Benchmark]: Toolchain (without parser) took 6219.70 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.7 MB). Free memory was 939.2 MB in the beginning and 1.3 GB in the end (delta: -316.6 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:29,692 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:29,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 670.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:29,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.37 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.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:29,696 INFO L168 Benchmark]: Boogie Preprocessor took 36.82 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-10-22 08:57:29,696 INFO L168 Benchmark]: RCFGBuilder took 348.44 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.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:29,697 INFO L168 Benchmark]: BuchiAutomizer took 5092.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -158.4 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:29,698 INFO L168 Benchmark]: Witness Printer took 4.48 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:29,700 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 670.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.37 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.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.82 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 348.44 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.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5092.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -158.4 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.48 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 5.0s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. 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: 10ms 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...