./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.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/working_dir_98c2ab44-a822-416c-82da-a9a9dd53fc2f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_98c2ab44-a822-416c-82da-a9a9dd53fc2f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_98c2ab44-a822-416c-82da-a9a9dd53fc2f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_98c2ab44-a822-416c-82da-a9a9dd53fc2f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_98c2ab44-a822-416c-82da-a9a9dd53fc2f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_98c2ab44-a822-416c-82da-a9a9dd53fc2f/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 cf112a0fbbdfc44a3bb289156f3ed9f3cdfb386d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:56:25,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:25,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:25,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:25,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:25,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:25,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:25,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:25,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:25,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:25,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:25,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:25,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:25,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:25,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:25,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:25,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:25,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:25,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:25,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:25,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:25,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:25,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:25,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:25,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:25,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:25,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:25,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:25,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:25,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:25,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:25,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:25,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:25,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:25,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:25,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:25,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:25,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:25,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:25,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:25,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:25,356 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_98c2ab44-a822-416c-82da-a9a9dd53fc2f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:56:25,384 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:25,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:25,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:25,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:25,386 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:25,386 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:25,388 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:25,389 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:25,389 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:25,389 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:25,389 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:25,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:25,390 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:25,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:25,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:25,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:25,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:25,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:25,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:25,391 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:25,391 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:25,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:25,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:25,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:25,392 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:25,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:25,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:25,393 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:25,394 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:25,394 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_98c2ab44-a822-416c-82da-a9a9dd53fc2f/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 -> cf112a0fbbdfc44a3bb289156f3ed9f3cdfb386d [2019-10-22 08:56:25,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:25,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:25,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:25,455 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:25,455 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:25,456 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_98c2ab44-a822-416c-82da-a9a9dd53fc2f/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.i [2019-10-22 08:56:25,517 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98c2ab44-a822-416c-82da-a9a9dd53fc2f/bin/uautomizer/data/7e0152788/77f0fca3a81c41fb828d4be5b07697de/FLAG63cba3ac1 [2019-10-22 08:56:25,986 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:25,987 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_98c2ab44-a822-416c-82da-a9a9dd53fc2f/sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.i [2019-10-22 08:56:25,998 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98c2ab44-a822-416c-82da-a9a9dd53fc2f/bin/uautomizer/data/7e0152788/77f0fca3a81c41fb828d4be5b07697de/FLAG63cba3ac1 [2019-10-22 08:56:26,290 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_98c2ab44-a822-416c-82da-a9a9dd53fc2f/bin/uautomizer/data/7e0152788/77f0fca3a81c41fb828d4be5b07697de [2019-10-22 08:56:26,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:26,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:26,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:26,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:26,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:26,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:26" (1/1) ... [2019-10-22 08:56:26,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a31e395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:26, skipping insertion in model container [2019-10-22 08:56:26,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:26" (1/1) ... [2019-10-22 08:56:26,311 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:26,353 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:26,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:26,711 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:26,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:26,803 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:26,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:26 WrapperNode [2019-10-22 08:56:26,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:26,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:26,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:26,804 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:26,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:26" (1/1) ... [2019-10-22 08:56:26,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:26" (1/1) ... [2019-10-22 08:56:26,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:26,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:26,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:26,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:26,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:26" (1/1) ... [2019-10-22 08:56:26,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:26" (1/1) ... [2019-10-22 08:56:26,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:26" (1/1) ... [2019-10-22 08:56:26,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:26" (1/1) ... [2019-10-22 08:56:26,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:26" (1/1) ... [2019-10-22 08:56:26,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:26" (1/1) ... [2019-10-22 08:56:26,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:26" (1/1) ... [2019-10-22 08:56:26,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:26,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:26,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:26,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:26,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c2ab44-a822-416c-82da-a9a9dd53fc2f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:26,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:26,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:26,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:26,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:26,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:26,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:27,166 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:27,166 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:56:27,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:27 BoogieIcfgContainer [2019-10-22 08:56:27,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:27,168 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:27,168 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:27,171 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:27,172 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:27,172 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:26" (1/3) ... [2019-10-22 08:56:27,173 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30f5fe5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:27, skipping insertion in model container [2019-10-22 08:56:27,173 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:27,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:26" (2/3) ... [2019-10-22 08:56:27,174 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30f5fe5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:27, skipping insertion in model container [2019-10-22 08:56:27,174 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:27,174 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:27" (3/3) ... [2019-10-22 08:56:27,175 INFO L371 chiAutomizerObserver]: Analyzing ICFG subseq-alloca-1.i [2019-10-22 08:56:27,212 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:27,212 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:27,212 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:27,212 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:27,212 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:27,212 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:27,213 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:27,213 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:27,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 08:56:27,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:27,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:27,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:27,245 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:27,245 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:27,245 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:27,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 08:56:27,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:27,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:27,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:27,247 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:27,247 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:27,254 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 11#L563true assume !(main_~length1~0 < 1); 15#L563-2true assume !(main_~length2~0 < 1); 8#L566-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 6#L551-5true [2019-10-22 08:56:27,254 INFO L793 eck$LassoCheckResult]: Loop: 6#L551-5true call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 16#L551-1true assume subseq_#t~short4;call subseq_#t~mem3 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem3; 3#L551-3true assume !!subseq_#t~short4;havoc subseq_#t~mem3;havoc subseq_#t~short4;havoc subseq_#t~mem2;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 12#L552true assume subseq_#t~mem5 == subseq_#t~mem6;havoc subseq_#t~mem6;havoc subseq_#t~mem5;subseq_#t~post7.base, subseq_#t~post7.offset := subseq_~ps~0.base, subseq_~ps~0.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_#t~post7.base, 1 + subseq_#t~post7.offset;havoc subseq_#t~post7.base, subseq_#t~post7.offset; 17#L552-2true subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 6#L551-5true [2019-10-22 08:56:27,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:27,259 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:56:27,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:27,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300240555] [2019-10-22 08:56:27,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:27,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:27,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:27,397 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:27,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:27,398 INFO L82 PathProgramCache]: Analyzing trace with hash 47815647, now seen corresponding path program 1 times [2019-10-22 08:56:27,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:27,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994048918] [2019-10-22 08:56:27,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:27,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:27,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:27,424 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:27,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:27,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1594114490, now seen corresponding path program 1 times [2019-10-22 08:56:27,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:27,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883248028] [2019-10-22 08:56:27,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:27,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:27,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:27,497 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:27,698 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-10-22 08:56:28,174 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-10-22 08:56:28,325 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-22 08:56:28,338 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:28,339 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:28,339 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:28,339 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:28,339 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:28,339 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:28,340 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:28,340 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:28,340 INFO L131 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-1.i_Iteration1_Lasso [2019-10-22 08:56:28,340 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:28,340 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:28,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:28,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:28,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:28,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:28,835 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-10-22 08:56:29,044 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-22 08:56:29,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:29,857 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:56:30,068 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:30,073 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:30,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:30,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:30,077 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:30,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:30,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:30,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:30,080 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:30,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:30,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:30,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:30,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:30,083 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:30,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:30,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:30,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:30,084 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:30,084 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:30,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:30,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:30,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:30,087 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:30,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:30,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:30,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:30,088 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:30,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:30,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:30,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:30,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:30,091 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:56:30,092 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:30,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:30,112 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:56:30,113 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:30,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:30,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:30,251 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:30,252 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:30,252 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:30,252 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:30,272 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:30,272 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:30,413 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:30,521 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:56:30,521 INFO L444 ModelExtractionUtils]: 40 out of 49 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-10-22 08:56:30,524 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:30,525 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:30,526 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:30,526 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_subseq_~ps~0.offset, v_rep(select #length ULTIMATE.start_subseq_~ps~0.base)_1) = -1*ULTIMATE.start_subseq_~ps~0.offset + 1*v_rep(select #length ULTIMATE.start_subseq_~ps~0.base)_1 Supporting invariants [] [2019-10-22 08:56:30,581 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-10-22 08:56:30,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:56:30,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:30,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:30,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:30,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:56:30,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:30,708 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:56:30,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2019-10-22 08:56:30,764 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 38 states and 51 transitions. Complement of second has 7 states. [2019-10-22 08:56:30,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-10-22 08:56:30,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 5 letters. [2019-10-22 08:56:30,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:30,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 5 letters. [2019-10-22 08:56:30,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:30,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:56:30,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:30,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 51 transitions. [2019-10-22 08:56:30,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:30,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 20 states and 28 transitions. [2019-10-22 08:56:30,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:30,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:56:30,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-10-22 08:56:30,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:30,781 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-10-22 08:56:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-10-22 08:56:30,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-10-22 08:56:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:56:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-10-22 08:56:30,808 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 08:56:30,808 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 08:56:30,809 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:30,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-10-22 08:56:30,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:30,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:30,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:30,810 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:56:30,810 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:30,810 INFO L791 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 176#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 177#L563 assume !(main_~length1~0 < 1); 182#L563-2 assume !(main_~length2~0 < 1); 191#L566-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 192#L551-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 188#L551-1 [2019-10-22 08:56:30,810 INFO L793 eck$LassoCheckResult]: Loop: 188#L551-1 assume subseq_#t~short4;call subseq_#t~mem3 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem3; 178#L551-3 assume !!subseq_#t~short4;havoc subseq_#t~mem3;havoc subseq_#t~short4;havoc subseq_#t~mem2;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 179#L552 assume !(subseq_#t~mem5 == subseq_#t~mem6);havoc subseq_#t~mem6;havoc subseq_#t~mem5; 184#L552-2 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 187#L551-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 188#L551-1 [2019-10-22 08:56:30,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:30,811 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-10-22 08:56:30,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:30,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721928488] [2019-10-22 08:56:30,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:30,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:30,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:30,842 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:30,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:30,842 INFO L82 PathProgramCache]: Analyzing trace with hash 50829449, now seen corresponding path program 1 times [2019-10-22 08:56:30,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:30,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079472606] [2019-10-22 08:56:30,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:30,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:30,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:30,855 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:30,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:30,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2122056420, now seen corresponding path program 1 times [2019-10-22 08:56:30,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:30,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981191643] [2019-10-22 08:56:30,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:30,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:30,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:30,899 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:31,026 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-22 08:56:31,222 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:56:31,658 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 103 [2019-10-22 08:56:32,097 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-22 08:56:32,099 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:32,100 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:32,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:32,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:32,100 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:32,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:32,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:32,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:32,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-1.i_Iteration2_Lasso [2019-10-22 08:56:32,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:32,101 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:32,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,826 WARN L191 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-10-22 08:56:32,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,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-10-22 08:56:32,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-10-22 08:56:32,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,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-10-22 08:56:32,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,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-10-22 08:56:32,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,470 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-10-22 08:56:33,788 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:56:33,860 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:33,860 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:33,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,861 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,861 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,861 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,861 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,862 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,862 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,864 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,864 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,864 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,865 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:33,865 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:33,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,868 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,869 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,869 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,870 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,873 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:33,873 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:33,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,880 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,880 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,880 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,883 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:33,883 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:33,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,893 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,893 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,894 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:33,894 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:33,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,902 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:33,902 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:33,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,906 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:33,907 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:33,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,909 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-10-22 08:56:33,909 INFO L203 nArgumentSynthesizer]: 8 loop disjuncts [2019-10-22 08:56:33,909 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,957 INFO L400 nArgumentSynthesizer]: We have 192 Motzkin's Theorem applications. [2019-10-22 08:56:33,957 INFO L401 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2019-10-22 08:56:34,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:34,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:34,617 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:34,617 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:34,617 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:34,617 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:34,618 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:34,618 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:34,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:34,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:34,621 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:34,622 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:56:34,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:34,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:34,625 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:56:34,625 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:34,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:34,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:34,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:34,649 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:34,649 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:34,649 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:34,651 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:34,652 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:34,672 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:34,693 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:56:34,693 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:56:34,693 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:34,694 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:34,694 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:34,694 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_subseq_~pt~0.offset, v_rep(select #length ULTIMATE.start_subseq_~pt~0.base)_2) = -1*ULTIMATE.start_subseq_~pt~0.offset + 1*v_rep(select #length ULTIMATE.start_subseq_~pt~0.base)_2 Supporting invariants [] [2019-10-22 08:56:34,746 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-10-22 08:56:34,748 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:56:34,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:34,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:34,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:34,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:56:34,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:34,819 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:56:34,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-10-22 08:56:34,849 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 35 states and 51 transitions. Complement of second has 6 states. [2019-10-22 08:56:34,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:34,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-10-22 08:56:34,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 5 letters. [2019-10-22 08:56:34,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:34,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 5 letters. [2019-10-22 08:56:34,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:34,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 10 letters. [2019-10-22 08:56:34,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:34,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2019-10-22 08:56:34,854 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:34,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2019-10-22 08:56:34,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:56:34,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:56:34,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:56:34,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:34,857 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:34,857 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:34,857 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:34,857 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:34,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:56:34,857 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:34,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:56:34,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:56:34 BoogieIcfgContainer [2019-10-22 08:56:34,864 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:56:34,865 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:34,865 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:34,865 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:34,866 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:27" (3/4) ... [2019-10-22 08:56:34,869 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:56:34,869 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:34,870 INFO L168 Benchmark]: Toolchain (without parser) took 8577.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.8 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -274.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:34,872 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:34,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 509.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -151.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:34,873 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:34,874 INFO L168 Benchmark]: Boogie Preprocessor took 27.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:34,875 INFO L168 Benchmark]: RCFGBuilder took 290.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:34,875 INFO L168 Benchmark]: BuchiAutomizer took 7696.80 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -153.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:34,876 INFO L168 Benchmark]: Witness Printer took 3.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:34,879 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 509.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -151.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 290.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7696.80 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -153.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * ps + unknown-#length-unknown[ps] and consists of 5 locations. One deterministic module has affine ranking function -1 * pt + unknown-#length-unknown[pt] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 7.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 36 SDslu, 15 SDs, 0 SdLazy, 19 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital354 mio100 ax106 hnf99 lsp72 ukn102 mio100 lsp30 div100 bol100 ite100 ukn100 eq202 hnf88 smp100 dnf325 smp78 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 705ms VariablesStem: 3 VariablesLoop: 5 DisjunctsStem: 3 DisjunctsLoop: 8 SupportingInvariants: 16 MotzkinApplications: 192 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...