./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4fc2139d-314f-4797-8f0d-a928727773e0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4fc2139d-314f-4797-8f0d-a928727773e0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4fc2139d-314f-4797-8f0d-a928727773e0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4fc2139d-314f-4797-8f0d-a928727773e0/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4fc2139d-314f-4797-8f0d-a928727773e0/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4fc2139d-314f-4797-8f0d-a928727773e0/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 64bit --witnessprinter.graph.data.programhash 6b0415ceba0811795bdd9d25bfbda379c533d6bc .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:06:10,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:06:10,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:06:10,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:06:10,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:06:10,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:06:10,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:06:10,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:06:10,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:06:10,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:06:10,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:06:10,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:06:10,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:06:10,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:06:10,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:06:10,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:06:10,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:06:10,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:06:10,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:06:10,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:06:10,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:06:10,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:06:10,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:06:10,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:06:10,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:06:10,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:06:10,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:06:10,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:06:10,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:06:10,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:06:10,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:06:10,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:06:10,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:06:10,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:06:10,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:06:10,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:06:10,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:06:10,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:06:10,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:06:10,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:06:10,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:06:10,346 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4fc2139d-314f-4797-8f0d-a928727773e0/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:06:10,365 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:06:10,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:06:10,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:06:10,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:06:10,367 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:06:10,367 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:06:10,368 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:06:10,368 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:06:10,368 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:06:10,368 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:06:10,369 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:06:10,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:06:10,369 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:06:10,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:06:10,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:06:10,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:06:10,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:06:10,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:06:10,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:06:10,371 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:06:10,371 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:06:10,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:06:10,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:06:10,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:06:10,372 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:06:10,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:06:10,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:06:10,373 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:06:10,374 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:06:10,374 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_4fc2139d-314f-4797-8f0d-a928727773e0/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b0415ceba0811795bdd9d25bfbda379c533d6bc [2019-11-15 21:06:10,432 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:06:10,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:06:10,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:06:10,449 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:06:10,449 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:06:10,453 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4fc2139d-314f-4797-8f0d-a928727773e0/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i [2019-11-15 21:06:10,532 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4fc2139d-314f-4797-8f0d-a928727773e0/bin/uautomizer/data/927e8cd67/3a85fdc536f643d180498c247046b080/FLAG5bed89c14 [2019-11-15 21:06:11,102 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:06:11,103 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4fc2139d-314f-4797-8f0d-a928727773e0/sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i [2019-11-15 21:06:11,117 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4fc2139d-314f-4797-8f0d-a928727773e0/bin/uautomizer/data/927e8cd67/3a85fdc536f643d180498c247046b080/FLAG5bed89c14 [2019-11-15 21:06:11,429 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4fc2139d-314f-4797-8f0d-a928727773e0/bin/uautomizer/data/927e8cd67/3a85fdc536f643d180498c247046b080 [2019-11-15 21:06:11,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:06:11,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:06:11,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:06:11,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:06:11,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:06:11,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:06:11" (1/1) ... [2019-11-15 21:06:11,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740f673d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:11, skipping insertion in model container [2019-11-15 21:06:11,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:06:11" (1/1) ... [2019-11-15 21:06:11,451 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:06:11,503 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:06:11,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:06:11,868 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:06:11,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:06:11,966 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:06:11,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:11 WrapperNode [2019-11-15 21:06:11,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:06:11,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:06:11,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:06:11,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:06:11,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:11" (1/1) ... [2019-11-15 21:06:11,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:11" (1/1) ... [2019-11-15 21:06:12,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:06:12,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:06:12,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:06:12,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:06:12,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:11" (1/1) ... [2019-11-15 21:06:12,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:11" (1/1) ... [2019-11-15 21:06:12,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:11" (1/1) ... [2019-11-15 21:06:12,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:11" (1/1) ... [2019-11-15 21:06:12,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:11" (1/1) ... [2019-11-15 21:06:12,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:11" (1/1) ... [2019-11-15 21:06:12,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:11" (1/1) ... [2019-11-15 21:06:12,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:06:12,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:06:12,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:06:12,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:06:12,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4fc2139d-314f-4797-8f0d-a928727773e0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:06:12,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:06:12,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:06:12,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:06:12,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:06:12,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:06:12,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:06:12,342 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:06:12,342 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:06:12,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:06:12 BoogieIcfgContainer [2019-11-15 21:06:12,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:06:12,344 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:06:12,345 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:06:12,348 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:06:12,349 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:06:12,349 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:06:11" (1/3) ... [2019-11-15 21:06:12,350 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3930eb6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:06:12, skipping insertion in model container [2019-11-15 21:06:12,350 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:06:12,351 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:11" (2/3) ... [2019-11-15 21:06:12,351 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3930eb6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:06:12, skipping insertion in model container [2019-11-15 21:06:12,351 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:06:12,351 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:06:12" (3/3) ... [2019-11-15 21:06:12,353 INFO L371 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca-2.i [2019-11-15 21:06:12,455 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:06:12,455 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:06:12,456 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:06:12,456 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:06:12,456 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:06:12,456 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:06:12,456 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:06:12,457 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:06:12,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-15 21:06:12,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:06:12,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:06:12,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:06:12,523 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:06:12,523 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:06:12,523 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:06:12,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-15 21:06:12,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:06:12,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:06:12,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:06:12,526 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:06:12,526 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:06:12,543 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 7#L564true assume !(main_~array_size~0 < 1); 10#L564-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 15#L552-3true [2019-11-15 21:06:12,544 INFO L793 eck$LassoCheckResult]: Loop: 15#L552-3true assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 9#L555-3true assume !true; 12#L552-2true sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 15#L552-3true [2019-11-15 21:06:12,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:12,551 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-15 21:06:12,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:06:12,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330470304] [2019-11-15 21:06:12,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:12,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:12,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:06:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:12,738 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:06:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:12,740 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2019-11-15 21:06:12,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:06:12,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897339088] [2019-11-15 21:06:12,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:12,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:12,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:06:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:06:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:06:12,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897339088] [2019-11-15 21:06:12,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:06:12,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:06:12,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947415331] [2019-11-15 21:06:12,804 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:06:12,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:06:12,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 21:06:12,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 21:06:12,826 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-11-15 21:06:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:06:12,835 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-11-15 21:06:12,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 21:06:12,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-11-15 21:06:12,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:06:12,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2019-11-15 21:06:12,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 21:06:12,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 21:06:12,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-11-15 21:06:12,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:06:12,850 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-15 21:06:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-11-15 21:06:12,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-15 21:06:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 21:06:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-11-15 21:06:12,882 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-15 21:06:12,882 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-15 21:06:12,882 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:06:12,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-11-15 21:06:12,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:06:12,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:06:12,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:06:12,885 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:06:12,885 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:06:12,885 INFO L791 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L564 assume !(main_~array_size~0 < 1); 36#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 40#L552-3 [2019-11-15 21:06:12,885 INFO L793 eck$LassoCheckResult]: Loop: 40#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 38#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 39#L555-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 41#L552-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 40#L552-3 [2019-11-15 21:06:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-15 21:06:12,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:06:12,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543646929] [2019-11-15 21:06:12,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:12,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:12,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:06:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:12,934 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:06:12,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:12,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2019-11-15 21:06:12,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:06:12,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175913667] [2019-11-15 21:06:12,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:12,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:12,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:06:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:12,956 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:06:12,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:12,957 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2019-11-15 21:06:12,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:06:12,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055234132] [2019-11-15 21:06:12,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:12,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:12,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:06:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:13,013 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:06:13,229 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-15 21:06:13,333 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:06:13,335 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:06:13,336 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:06:13,336 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:06:13,336 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:06:13,336 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:06:13,337 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:06:13,345 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:06:13,346 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-2.i_Iteration2_Lasso [2019-11-15 21:06:13,346 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:06:13,346 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:06:13,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:13,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:13,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:13,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:13,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:13,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-11-15 21:06:13,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:13,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:13,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:13,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:13,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:13,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:13,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:13,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:13,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:13,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:14,024 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:06:14,032 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:06:14,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:14,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:14,038 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:14,040 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:14,040 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:14,040 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:14,045 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:14,045 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:14,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:14,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:14,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:14,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:14,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:14,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:14,063 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:06:14,063 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:06:14,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:14,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:14,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:14,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:14,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:14,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:14,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:14,092 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:14,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:14,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:14,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:14,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:14,101 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:14,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:14,102 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:14,104 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:06:14,105 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:06:14,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:14,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:14,117 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:14,118 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:14,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:14,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:14,131 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:06:14,134 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:06:14,258 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:06:14,318 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:06:14,322 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:06:14,325 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:06:14,329 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:06:14,330 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:06:14,331 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2019-11-15 21:06:14,340 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 21:06:14,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:06:14,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:06:14,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:06:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:06:14,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:06:14,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:06:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:06:14,435 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:06:14,435 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-11-15 21:06:14,471 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2019-11-15 21:06:14,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:06:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:06:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-15 21:06:14,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-15 21:06:14,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:06:14,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-15 21:06:14,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:06:14,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2019-11-15 21:06:14,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:06:14,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2019-11-15 21:06:14,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:06:14,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2019-11-15 21:06:14,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 21:06:14,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 21:06:14,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-15 21:06:14,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:06:14,482 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 21:06:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-15 21:06:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-11-15 21:06:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 21:06:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-11-15 21:06:14,484 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-15 21:06:14,484 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-15 21:06:14,485 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:06:14,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-11-15 21:06:14,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:06:14,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:06:14,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:06:14,486 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:06:14,486 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:06:14,487 INFO L791 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 103#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 104#L564 assume !(main_~array_size~0 < 1); 105#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 111#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 107#L555-3 [2019-11-15 21:06:14,487 INFO L793 eck$LassoCheckResult]: Loop: 107#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 108#L555-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 107#L555-3 [2019-11-15 21:06:14,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:14,487 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-15 21:06:14,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:06:14,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877630786] [2019-11-15 21:06:14,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:14,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:14,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:06:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:14,522 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:06:14,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:14,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2019-11-15 21:06:14,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:06:14,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768160931] [2019-11-15 21:06:14,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:14,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:14,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:06:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:14,536 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:06:14,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:14,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-11-15 21:06:14,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:06:14,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743370359] [2019-11-15 21:06:14,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:14,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:14,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:06:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:14,570 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:06:14,839 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-11-15 21:06:14,922 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:06:14,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:06:14,923 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:06:14,923 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:06:14,923 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:06:14,923 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:06:14,923 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:06:14,923 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:06:14,924 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-2.i_Iteration3_Lasso [2019-11-15 21:06:14,924 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:06:14,924 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:06:14,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:14,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:14,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:14,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:14,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:14,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:14,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:14,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:14,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:14,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:14,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:15,126 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-11-15 21:06:15,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:15,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:15,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:15,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:15,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:15,532 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:06:15,532 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:06:15,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-11-15 21:06:15,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:15,533 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:15,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:15,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:15,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:15,535 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:15,535 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:15,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:15,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:15,537 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:15,537 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:15,537 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:15,537 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:15,537 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:15,538 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:15,538 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:15,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:15,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-11-15 21:06:15,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:15,540 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:15,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:15,540 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:15,540 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:15,541 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:15,562 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:15,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:15,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:15,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:15,566 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:15,566 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:15,566 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:15,568 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:06:15,569 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:06:15,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:15,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:15,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:15,574 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:15,574 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:15,574 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:15,574 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:15,575 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:15,575 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:15,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:15,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:15,577 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:15,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:15,578 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:15,578 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:15,579 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:06:15,580 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:06:15,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:15,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:15,584 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:15,584 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:15,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:15,585 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:15,585 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:15,585 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:15,585 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:15,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:15,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:15,587 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:15,587 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:15,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:15,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:15,588 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:15,589 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:15,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:15,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:15,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:15,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:15,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:15,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:15,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:15,593 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:06:15,593 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:06:15,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:15,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:15,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:15,597 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:15,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:15,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:15,597 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:15,598 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:15,598 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:15,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:15,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:15,600 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:15,601 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 21:06:15,601 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:15,601 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:15,604 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 21:06:15,605 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:06:15,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:15,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:15,622 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:15,623 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:15,623 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:15,623 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:15,623 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:15,624 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:15,624 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:15,626 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:06:15,628 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:06:15,628 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:06:15,629 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:06:15,629 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:06:15,629 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:06:15,629 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2 Supporting invariants [] [2019-11-15 21:06:15,649 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 21:06:15,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:06:15,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:06:15,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:06:15,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:06:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:06:15,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:06:15,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:06:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:06:15,706 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:06:15,706 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 21:06:15,733 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 22 states and 29 transitions. Complement of second has 7 states. [2019-11-15 21:06:15,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:06:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:06:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-15 21:06:15,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 21:06:15,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:06:15,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 21:06:15,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:06:15,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 21:06:15,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:06:15,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2019-11-15 21:06:15,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:06:15,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 21 transitions. [2019-11-15 21:06:15,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 21:06:15,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 21:06:15,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-15 21:06:15,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:06:15,738 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 21:06:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-15 21:06:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-11-15 21:06:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 21:06:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-11-15 21:06:15,746 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-15 21:06:15,746 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-15 21:06:15,746 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:06:15,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-11-15 21:06:15,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:06:15,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:06:15,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:06:15,749 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:06:15,749 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:06:15,749 INFO L791 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 194#L564 assume !(main_~array_size~0 < 1); 195#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 201#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 204#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 205#L555-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 202#L552-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 203#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 197#L555-3 [2019-11-15 21:06:15,750 INFO L793 eck$LassoCheckResult]: Loop: 197#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 198#L555-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 197#L555-3 [2019-11-15 21:06:15,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:15,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2019-11-15 21:06:15,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:06:15,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426162867] [2019-11-15 21:06:15,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:15,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:15,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:06:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:15,793 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:06:15,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:15,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2019-11-15 21:06:15,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:06:15,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60865343] [2019-11-15 21:06:15,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:15,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:15,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:06:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:15,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:06:15,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:15,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2019-11-15 21:06:15,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:06:15,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535502691] [2019-11-15 21:06:15,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:15,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:06:15,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:06:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:06:15,857 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:06:16,111 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-11-15 21:06:16,205 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:06:16,205 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:06:16,205 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:06:16,205 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:06:16,205 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:06:16,205 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:06:16,205 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:06:16,206 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:06:16,206 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-2.i_Iteration4_Lasso [2019-11-15 21:06:16,206 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:06:16,206 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:06:16,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:06:16,802 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:06:16,802 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:06:16,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:16,804 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:16,804 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:16,804 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:16,804 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:16,804 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:16,804 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:16,804 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:16,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:16,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:16,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:16,806 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:16,806 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:16,806 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:16,807 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:06:16,807 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:06:16,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:16,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:16,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:16,810 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:16,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:16,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:16,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:16,811 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:16,811 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:16,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:16,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:16,812 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:16,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:16,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:16,814 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:16,815 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:06:16,815 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:06:16,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:16,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:16,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:16,823 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:16,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:16,823 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:16,823 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:16,824 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:16,824 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:16,825 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:16,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:16,826 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:16,826 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:16,826 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:16,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:16,826 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:16,827 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:16,827 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:16,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:16,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:16,829 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:16,829 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:16,829 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:16,829 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:16,831 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:06:16,831 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:06:16,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:16,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:16,839 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:16,839 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:16,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:16,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:16,843 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:06:16,843 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:06:16,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:06:16,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:06:16,858 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:06:16,858 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:06:16,858 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:06:16,858 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:06:16,858 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:06:16,859 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:06:16,859 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:06:16,861 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:06:16,862 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:06:16,863 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:06:16,863 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:06:16,863 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:06:16,864 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:06:16,864 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3 Supporting invariants [] [2019-11-15 21:06:16,879 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-15 21:06:16,881 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:06:16,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:06:16,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:06:16,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:06:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:06:16,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:06:16,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:06:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:06:16,940 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:06:16,940 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 21:06:16,960 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2019-11-15 21:06:16,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:06:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:06:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-15 21:06:16,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 21:06:16,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:06:16,962 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:06:16,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:06:16,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:06:16,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:06:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:06:16,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:06:16,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:06:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:06:17,006 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:06:17,006 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 21:06:17,033 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2019-11-15 21:06:17,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:06:17,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:06:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-15 21:06:17,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 21:06:17,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:06:17,035 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:06:17,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:06:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:06:17,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:06:17,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:06:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:06:17,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:06:17,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:06:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:06:17,094 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:06:17,094 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 21:06:17,120 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2019-11-15 21:06:17,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:06:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:06:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 21:06:17,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 21:06:17,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:06:17,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-15 21:06:17,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:06:17,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-15 21:06:17,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:06:17,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-11-15 21:06:17,125 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:06:17,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-11-15 21:06:17,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:06:17,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:06:17,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:06:17,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:06:17,126 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:06:17,126 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:06:17,126 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:06:17,126 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:06:17,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:06:17,127 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:06:17,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:06:17,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:06:17 BoogieIcfgContainer [2019-11-15 21:06:17,135 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:06:17,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:06:17,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:06:17,136 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:06:17,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:06:12" (3/4) ... [2019-11-15 21:06:17,140 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:06:17,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:06:17,143 INFO L168 Benchmark]: Toolchain (without parser) took 5709.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 947.3 MB in the beginning and 965.2 MB in the end (delta: -17.9 MB). Peak memory consumption was 193.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:06:17,143 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:06:17,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:06:17,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:06:17,147 INFO L168 Benchmark]: Boogie Preprocessor took 29.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:06:17,149 INFO L168 Benchmark]: RCFGBuilder took 299.22 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:06:17,156 INFO L168 Benchmark]: BuchiAutomizer took 4791.16 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 965.2 MB in the end (delta: 125.8 MB). Peak memory consumption was 204.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:06:17,156 INFO L168 Benchmark]: Witness Printer took 4.45 ms. Allocated memory is still 1.2 GB. Free memory is still 965.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:06:17,162 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 528.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 299.22 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4791.16 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 965.2 MB in the end (delta: 125.8 MB). Peak memory consumption was 204.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.45 ms. Allocated memory is still 1.2 GB. Free memory is still 965.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 59 SDtfs, 44 SDslu, 10 SDs, 0 SdLazy, 32 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax113 hnf99 lsp79 ukn82 mio100 lsp56 div100 bol100 ite100 ukn100 eq193 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...