./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strspn.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_ff780d0e-d7d7-4ca8-8efd-4cffcf9ed3fe/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ff780d0e-d7d7-4ca8-8efd-4cffcf9ed3fe/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ff780d0e-d7d7-4ca8-8efd-4cffcf9ed3fe/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ff780d0e-d7d7-4ca8-8efd-4cffcf9ed3fe/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strspn.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ff780d0e-d7d7-4ca8-8efd-4cffcf9ed3fe/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ff780d0e-d7d7-4ca8-8efd-4cffcf9ed3fe/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 aca5f83919a6623f93755f2c57c9c6598ba71e3b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:16:57,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:16:57,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:16:57,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:16:57,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:16:57,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:16:57,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:16:57,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:16:57,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:16:57,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:16:57,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:16:57,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:16:57,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:16:57,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:16:57,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:16:57,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:16:57,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:16:57,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:16:58,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:16:58,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:16:58,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:16:58,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:16:58,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:16:58,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:16:58,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:16:58,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:16:58,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:16:58,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:16:58,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:16:58,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:16:58,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:16:58,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:16:58,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:16:58,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:16:58,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:16:58,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:16:58,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:16:58,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:16:58,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:16:58,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:16:58,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:16:58,024 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ff780d0e-d7d7-4ca8-8efd-4cffcf9ed3fe/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:16:58,049 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:16:58,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:16:58,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:16:58,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:16:58,051 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:16:58,051 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:16:58,051 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:16:58,051 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:16:58,051 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:16:58,052 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:16:58,052 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:16:58,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:16:58,052 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:16:58,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:16:58,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:16:58,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:16:58,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:16:58,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:16:58,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:16:58,053 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:16:58,054 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:16:58,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:16:58,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:16:58,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:16:58,054 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:16:58,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:16:58,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:16:58,055 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:16:58,055 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:16:58,056 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_ff780d0e-d7d7-4ca8-8efd-4cffcf9ed3fe/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 -> aca5f83919a6623f93755f2c57c9c6598ba71e3b [2019-11-16 00:16:58,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:16:58,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:16:58,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:16:58,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:16:58,102 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:16:58,103 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ff780d0e-d7d7-4ca8-8efd-4cffcf9ed3fe/bin/uautomizer/../../sv-benchmarks/c/termination-libowfat/strspn.i [2019-11-16 00:16:58,166 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff780d0e-d7d7-4ca8-8efd-4cffcf9ed3fe/bin/uautomizer/data/02802f66e/6f199953cb7c40eca456feb910d28496/FLAG2dd06ff5a [2019-11-16 00:16:58,615 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:16:58,616 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ff780d0e-d7d7-4ca8-8efd-4cffcf9ed3fe/sv-benchmarks/c/termination-libowfat/strspn.i [2019-11-16 00:16:58,630 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff780d0e-d7d7-4ca8-8efd-4cffcf9ed3fe/bin/uautomizer/data/02802f66e/6f199953cb7c40eca456feb910d28496/FLAG2dd06ff5a [2019-11-16 00:16:58,643 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ff780d0e-d7d7-4ca8-8efd-4cffcf9ed3fe/bin/uautomizer/data/02802f66e/6f199953cb7c40eca456feb910d28496 [2019-11-16 00:16:58,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:16:58,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:16:58,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:16:58,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:16:58,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:16:58,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:16:58" (1/1) ... [2019-11-16 00:16:58,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@228027dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:58, skipping insertion in model container [2019-11-16 00:16:58,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:16:58" (1/1) ... [2019-11-16 00:16:58,670 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:16:58,721 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:16:59,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:16:59,118 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:16:59,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:16:59,209 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:16:59,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:59 WrapperNode [2019-11-16 00:16:59,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:16:59,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:16:59,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:16:59,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:16:59,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:59" (1/1) ... [2019-11-16 00:16:59,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:59" (1/1) ... [2019-11-16 00:16:59,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:16:59,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:16:59,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:16:59,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:16:59,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:59" (1/1) ... [2019-11-16 00:16:59,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:59" (1/1) ... [2019-11-16 00:16:59,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:59" (1/1) ... [2019-11-16 00:16:59,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:59" (1/1) ... [2019-11-16 00:16:59,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:59" (1/1) ... [2019-11-16 00:16:59,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:59" (1/1) ... [2019-11-16 00:16:59,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:59" (1/1) ... [2019-11-16 00:16:59,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:16:59,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:16:59,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:16:59,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:16:59,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff780d0e-d7d7-4ca8-8efd-4cffcf9ed3fe/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-16 00:16:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:16:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:16:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:16:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:16:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:16:59,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:16:59,586 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:16:59,586 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:16:59,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:16:59 BoogieIcfgContainer [2019-11-16 00:16:59,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:16:59,588 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:16:59,588 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:16:59,591 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:16:59,592 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:16:59,592 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:16:58" (1/3) ... [2019-11-16 00:16:59,593 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32233de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:16:59, skipping insertion in model container [2019-11-16 00:16:59,594 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:16:59,594 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:59" (2/3) ... [2019-11-16 00:16:59,594 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32233de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:16:59, skipping insertion in model container [2019-11-16 00:16:59,594 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:16:59,595 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:16:59" (3/3) ... [2019-11-16 00:16:59,596 INFO L371 chiAutomizerObserver]: Analyzing ICFG strspn.i [2019-11-16 00:16:59,639 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:16:59,640 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:16:59,642 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:16:59,642 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:16:59,642 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:16:59,643 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:16:59,643 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:16:59,643 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:16:59,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-16 00:16:59,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-16 00:16:59,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:16:59,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:16:59,680 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:16:59,680 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:16:59,680 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:16:59,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-16 00:16:59,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-16 00:16:59,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:16:59,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:16:59,682 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:16:59,682 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:16:59,687 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 9#L521true assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 6#L525true assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 19#L510-4true [2019-11-16 00:16:59,687 INFO L793 eck$LassoCheckResult]: Loop: 19#L510-4true call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 12#L510-1true assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4#L511-6true assume !true; 5#L511-7true call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 7#L512true assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 15#L510-3true strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 19#L510-4true [2019-11-16 00:16:59,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:59,691 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-11-16 00:16:59,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:59,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20701527] [2019-11-16 00:16:59,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:59,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:59,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:16:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:16:59,837 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:16:59,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:59,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1366197546, now seen corresponding path program 1 times [2019-11-16 00:16:59,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:59,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789659953] [2019-11-16 00:16:59,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:59,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:59,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:59,867 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-16 00:16:59,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789659953] [2019-11-16 00:16:59,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:16:59,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:16:59,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461770999] [2019-11-16 00:16:59,873 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:16:59,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:59,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:16:59,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:16:59,887 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-16 00:16:59,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:59,893 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-16 00:16:59,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:16:59,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-16 00:16:59,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-16 00:16:59,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 15 transitions. [2019-11-16 00:16:59,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-16 00:16:59,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-16 00:16:59,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-11-16 00:16:59,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:16:59,902 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-16 00:16:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-11-16 00:16:59,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-16 00:16:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:16:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-11-16 00:16:59,926 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-16 00:16:59,926 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-16 00:16:59,926 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:16:59,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2019-11-16 00:16:59,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-16 00:16:59,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:16:59,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:16:59,928 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:16:59,928 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:59,929 INFO L791 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 51#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 52#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 48#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 49#L510-4 [2019-11-16 00:16:59,929 INFO L793 eck$LassoCheckResult]: Loop: 49#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 55#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 44#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 45#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 53#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4;havoc strspn_#t~short7; 46#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 47#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 50#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 49#L510-4 [2019-11-16 00:16:59,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:59,929 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2019-11-16 00:16:59,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:59,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796484364] [2019-11-16 00:16:59,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:59,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:59,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:16:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:16:59,972 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:16:59,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:59,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1786909933, now seen corresponding path program 1 times [2019-11-16 00:16:59,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:59,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105959134] [2019-11-16 00:16:59,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:59,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:59,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:16:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:16:59,997 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:16:59,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:59,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1162005510, now seen corresponding path program 1 times [2019-11-16 00:16:59,998 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:59,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869331737] [2019-11-16 00:16:59,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:59,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:59,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:00,089 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:00,307 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-11-16 00:17:00,740 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-11-16 00:17:00,869 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-16 00:17:00,880 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:17:00,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:17:00,882 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:17:00,882 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:17:00,882 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:17:00,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:17:00,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:17:00,887 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:17:00,887 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn.i_Iteration2_Lasso [2019-11-16 00:17:00,887 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:17:00,888 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:17:00,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:00,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:00,923 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-16 00:17:00,925 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-16 00:17:00,927 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-16 00:17:00,931 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-16 00:17:00,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:00,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-16 00:17:00,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-16 00:17:00,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-16 00:17:00,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-16 00:17:00,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-11-16 00:17:00,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-11-16 00:17:00,964 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-16 00:17:00,968 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-16 00:17:00,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:00,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:01,330 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-11-16 00:17:01,453 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-16 00:17:01,457 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-16 00:17:01,461 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-16 00:17:02,121 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-16 00:17:02,266 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:17:02,271 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:17:02,273 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-16 00:17:02,274 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,275 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,276 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,276 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,278 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,278 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,280 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-16 00:17:02,281 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,281 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,282 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,283 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,284 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-16 00:17:02,285 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,285 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,285 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,285 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,285 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,286 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,286 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,287 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-16 00:17:02,288 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,288 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,289 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,289 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,289 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,289 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,291 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-16 00:17:02,291 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,291 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,292 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,292 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,292 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,293 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,293 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,294 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-16 00:17:02,295 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,295 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,295 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,295 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,298 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:02,298 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:02,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,301 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-16 00:17:02,302 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,302 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,303 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,303 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,304 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,305 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-16 00:17:02,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,305 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,307 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:02,308 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:02,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,323 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-16 00:17:02,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,324 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,324 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,325 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,325 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,327 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,328 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-16 00:17:02,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,329 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,329 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,330 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,333 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,334 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,334 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-16 00:17:02,335 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,337 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,338 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,338 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,339 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-16 00:17:02,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,342 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,343 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,343 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,343 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,343 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,348 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-16 00:17:02,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,349 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,350 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,356 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,358 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-16 00:17:02,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,359 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,359 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,360 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,361 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-16 00:17:02,362 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,362 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,362 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,362 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,363 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,363 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,366 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-16 00:17:02,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,367 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,368 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,368 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,369 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,369 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,373 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-16 00:17:02,374 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,374 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:17:02,375 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,375 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,382 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:17:02,382 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:02,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,463 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-16 00:17:02,464 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,465 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,465 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,465 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:17:02,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,467 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:17:02,467 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,474 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-16 00:17:02,475 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,475 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,476 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,476 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,481 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:02,481 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:02,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,510 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-16 00:17:02,511 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,511 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,511 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,511 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,513 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:02,513 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:02,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,517 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-16 00:17:02,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,519 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:02,519 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,520 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,520 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,520 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:02,520 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:02,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,525 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-16 00:17:02,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,526 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,526 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,527 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:02,527 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:02,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:02,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-16 00:17:02,534 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:02,535 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:02,535 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:02,535 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:02,541 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:02,541 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:02,597 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:17:02,628 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:17:02,629 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:17:02,631 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:17:02,633 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:17:02,634 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:17:02,634 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strspn_~s.base)_1, ULTIMATE.start_strspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_strspn_~s.base)_1 - 1*ULTIMATE.start_strspn_~s.offset Supporting invariants [] [2019-11-16 00:17:02,665 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-16 00:17:02,672 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:17:02,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:02,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:17:02,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:02,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:17:02,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:02,757 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-16 00:17:02,760 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-16 00:17:02,761 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-11-16 00:17:02,805 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 22 states and 27 transitions. Complement of second has 4 states. [2019-11-16 00:17:02,806 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-16 00:17:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:17:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-16 00:17:02,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. [2019-11-16 00:17:02,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:02,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 12 letters. Loop has 8 letters. [2019-11-16 00:17:02,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:02,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 16 letters. [2019-11-16 00:17:02,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:02,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2019-11-16 00:17:02,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:17:02,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 24 transitions. [2019-11-16 00:17:02,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-16 00:17:02,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:17:02,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2019-11-16 00:17:02,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:17:02,814 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-16 00:17:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2019-11-16 00:17:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-16 00:17:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-16 00:17:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-16 00:17:02,816 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-16 00:17:02,816 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-16 00:17:02,816 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:17:02,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-16 00:17:02,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:17:02,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:17:02,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:17:02,818 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:17:02,818 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:17:02,818 INFO L791 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 180#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 181#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 177#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 178#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 185#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 171#L511-6 [2019-11-16 00:17:02,819 INFO L793 eck$LassoCheckResult]: Loop: 171#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 172#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 182#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4;havoc strspn_#t~short7; 187#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 171#L511-6 [2019-11-16 00:17:02,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:02,819 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2019-11-16 00:17:02,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:02,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545111728] [2019-11-16 00:17:02,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:02,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:02,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:02,845 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:02,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:02,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 1 times [2019-11-16 00:17:02,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:02,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132780987] [2019-11-16 00:17:02,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:02,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:02,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:02,855 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:02,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:02,856 INFO L82 PathProgramCache]: Analyzing trace with hash 736220242, now seen corresponding path program 1 times [2019-11-16 00:17:02,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:02,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591882396] [2019-11-16 00:17:02,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:02,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:02,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:02,895 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:03,008 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-11-16 00:17:03,444 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2019-11-16 00:17:03,569 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-16 00:17:03,571 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:17:03,571 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:17:03,571 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:17:03,571 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:17:03,571 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:17:03,571 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:17:03,571 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:17:03,571 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:17:03,572 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn.i_Iteration3_Lasso [2019-11-16 00:17:03,572 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:17:03,572 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:17:03,576 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-16 00:17:03,588 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-16 00:17:03,927 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-16 00:17:04,011 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-16 00:17:04,014 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-16 00:17:04,015 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-16 00:17:04,017 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-16 00:17:04,020 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-16 00:17:04,021 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-16 00:17:04,022 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-16 00:17:04,025 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-16 00:17:04,026 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-16 00:17:04,028 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-16 00:17:04,029 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-16 00:17:04,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:04,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:04,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:04,036 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-16 00:17:04,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:04,039 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-16 00:17:04,041 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-16 00:17:04,598 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-16 00:17:04,761 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:17:04,762 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:17:04,762 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-16 00:17:04,763 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:04,763 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:04,763 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:04,763 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:04,763 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:04,764 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:04,764 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:04,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:04,765 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-16 00:17:04,765 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:04,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:04,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:04,766 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:04,766 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:04,766 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:04,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:04,768 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-16 00:17:04,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:04,769 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:17:04,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:04,769 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:04,772 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:17:04,773 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:04,794 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:04,795 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-16 00:17:04,795 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:04,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:04,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:04,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:04,797 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:04,797 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:04,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:04,798 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-16 00:17:04,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:04,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:04,799 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:04,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:04,802 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:04,802 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:04,849 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:17:04,872 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:17:04,872 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:17:04,873 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:17:04,873 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:17:04,874 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:17:04,874 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strspn_~a~0.base)_2, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_strspn_~a~0.base)_2 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2019-11-16 00:17:04,924 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-16 00:17:04,926 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:17:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:04,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:17:04,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:04,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:17:04,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:04,977 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-16 00:17:04,978 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-16 00:17:04,978 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-16 00:17:05,023 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 48 states and 60 transitions. Complement of second has 5 states. [2019-11-16 00:17:05,025 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-16 00:17:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:17:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-16 00:17:05,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-16 00:17:05,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:05,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-16 00:17:05,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:05,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 8 letters. [2019-11-16 00:17:05,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:05,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2019-11-16 00:17:05,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:17:05,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 32 states and 40 transitions. [2019-11-16 00:17:05,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-16 00:17:05,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:17:05,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2019-11-16 00:17:05,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:17:05,030 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-11-16 00:17:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2019-11-16 00:17:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-11-16 00:17:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:17:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-16 00:17:05,036 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-16 00:17:05,036 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-16 00:17:05,036 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:17:05,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2019-11-16 00:17:05,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:17:05,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:17:05,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:17:05,042 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:05,042 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:17:05,042 INFO L791 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 363#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 359#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 360#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 369#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 370#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 365#L511-1 assume !strspn_#t~short7; 366#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4;havoc strspn_#t~short7; 357#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 358#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 361#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 372#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 368#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 353#L511-6 [2019-11-16 00:17:05,042 INFO L793 eck$LassoCheckResult]: Loop: 353#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 354#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 364#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4;havoc strspn_#t~short7; 371#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 353#L511-6 [2019-11-16 00:17:05,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:05,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1779209729, now seen corresponding path program 1 times [2019-11-16 00:17:05,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:05,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538687496] [2019-11-16 00:17:05,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:05,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:05,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:05,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538687496] [2019-11-16 00:17:05,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:05,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:17:05,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733389767] [2019-11-16 00:17:05,124 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:17:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:05,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 2 times [2019-11-16 00:17:05,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:05,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621989804] [2019-11-16 00:17:05,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:05,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:05,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:05,132 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:05,238 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-11-16 00:17:05,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:05,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:17:05,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:05,262 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-16 00:17:05,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:05,337 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-11-16 00:17:05,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:17:05,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2019-11-16 00:17:05,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:17:05,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 38 transitions. [2019-11-16 00:17:05,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-16 00:17:05,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-16 00:17:05,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2019-11-16 00:17:05,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:17:05,340 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-16 00:17:05,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2019-11-16 00:17:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-11-16 00:17:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-16 00:17:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-16 00:17:05,343 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-16 00:17:05,343 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-16 00:17:05,343 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:17:05,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2019-11-16 00:17:05,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:17:05,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:17:05,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:17:05,345 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:05,345 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:17:05,345 INFO L791 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 433#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 434#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 430#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 431#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 440#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 441#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 449#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 446#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4;havoc strspn_#t~short7; 428#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 429#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 432#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 444#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 439#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 424#L511-6 [2019-11-16 00:17:05,345 INFO L793 eck$LassoCheckResult]: Loop: 424#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 425#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 435#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4;havoc strspn_#t~short7; 442#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 424#L511-6 [2019-11-16 00:17:05,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:05,345 INFO L82 PathProgramCache]: Analyzing trace with hash 4202367, now seen corresponding path program 2 times [2019-11-16 00:17:05,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:05,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637468288] [2019-11-16 00:17:05,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:05,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:05,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:05,368 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:05,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 3 times [2019-11-16 00:17:05,368 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:05,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838377258] [2019-11-16 00:17:05,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:05,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:05,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:05,375 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:05,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:05,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1675488540, now seen corresponding path program 1 times [2019-11-16 00:17:05,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:05,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438627790] [2019-11-16 00:17:05,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:05,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:05,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:05,402 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:06,160 WARN L191 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 133 [2019-11-16 00:17:06,288 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-16 00:17:06,289 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:17:06,289 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:17:06,289 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:17:06,289 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:17:06,289 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:17:06,289 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:17:06,290 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:17:06,290 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:17:06,290 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn.i_Iteration5_Lasso [2019-11-16 00:17:06,290 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:17:06,290 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:17:06,293 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-16 00:17:06,299 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-16 00:17:06,300 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-16 00:17:06,302 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-16 00:17:06,305 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-16 00:17:06,306 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-16 00:17:06,308 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-16 00:17:06,309 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-16 00:17:06,311 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-16 00:17:06,312 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-16 00:17:06,314 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-16 00:17:06,315 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-16 00:17:06,666 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-11-16 00:17:06,795 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-16 00:17:06,796 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-16 00:17:06,798 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-16 00:17:06,800 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-16 00:17:06,801 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-16 00:17:06,803 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-16 00:17:06,807 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-16 00:17:06,809 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-16 00:17:07,352 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-16 00:17:07,563 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:17:07,563 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:17:07,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:07,564 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,564 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:07,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,564 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,564 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,564 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:07,564 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:07,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,566 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-16 00:17:07,566 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,567 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:07,567 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,567 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,567 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,567 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:07,567 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:07,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,568 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-16 00:17:07,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,569 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,569 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,569 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,570 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:07,570 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:07,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,571 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-16 00:17:07,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,572 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:07,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,573 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:07,573 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:07,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,574 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-16 00:17:07,574 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,574 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:07,574 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,574 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,575 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:07,575 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:07,575 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,576 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-16 00:17:07,576 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,576 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:07,576 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,577 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,577 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:07,577 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:07,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,578 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-16 00:17:07,578 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,578 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:07,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,579 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:07,579 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:07,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,580 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-16 00:17:07,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,581 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:07,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,581 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,581 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,582 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:07,582 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:07,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,582 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-16 00:17:07,583 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,583 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:07,583 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,583 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,583 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,584 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:07,584 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:07,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,585 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-16 00:17:07,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,585 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,585 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,585 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,586 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:07,586 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:07,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,588 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-16 00:17:07,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,588 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:07,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,589 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,589 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,589 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:07,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:07,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,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-16 00:17:07,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,590 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:17:07,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,594 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:17:07,594 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:07,612 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,612 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-16 00:17:07,613 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,613 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,614 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:07,614 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:07,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,618 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-16 00:17:07,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,619 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,619 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,619 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,620 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:07,620 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:07,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,621 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-16 00:17:07,621 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,622 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:17:07,622 INFO L203 nArgumentSynthesizer]: 4 loop disjuncts [2019-11-16 00:17:07,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,631 INFO L400 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2019-11-16 00:17:07,631 INFO L401 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-11-16 00:17:07,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,685 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-16 00:17:07,685 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,686 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:07,687 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:07,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,688 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-16 00:17:07,688 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,689 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,689 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,689 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:07,690 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:07,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,691 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-16 00:17:07,691 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,692 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,693 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:07,693 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:07,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:07,697 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-16 00:17:07,698 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:07,698 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:07,698 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:07,698 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:07,701 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:07,701 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:07,743 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:17:07,778 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:17:07,778 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:17:07,779 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:17:07,779 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:17:07,780 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:17:07,780 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strspn_~a~0.base)_3, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_strspn_~a~0.base)_3 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2019-11-16 00:17:07,900 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2019-11-16 00:17:07,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:17:07,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:07,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:17:07,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:07,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:17:07,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:07,959 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-16 00:17:07,960 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-16 00:17:07,960 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-16 00:17:07,982 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 5 states. [2019-11-16 00:17:07,984 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-16 00:17:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:17:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-16 00:17:07,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-16 00:17:07,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:07,985 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:17:07,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:08,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:17:08,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:08,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:17:08,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:08,053 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-16 00:17:08,054 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-16 00:17:08,054 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-16 00:17:08,072 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 5 states. [2019-11-16 00:17:08,073 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-16 00:17:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:17:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-16 00:17:08,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-16 00:17:08,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:08,074 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:17:08,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:08,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:17:08,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:08,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:17:08,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:08,138 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-16 00:17:08,138 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-16 00:17:08,138 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-16 00:17:08,164 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 46 states and 57 transitions. Complement of second has 4 states. [2019-11-16 00:17:08,164 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-16 00:17:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:17:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2019-11-16 00:17:08,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-16 00:17:08,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:08,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 18 letters. Loop has 4 letters. [2019-11-16 00:17:08,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:08,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 14 letters. Loop has 8 letters. [2019-11-16 00:17:08,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:08,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2019-11-16 00:17:08,168 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:17:08,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2019-11-16 00:17:08,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:17:08,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:17:08,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:17:08,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:17:08,169 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:17:08,169 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:17:08,169 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:17:08,169 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:17:08,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:17:08,169 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:17:08,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:17:08,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:17:08 BoogieIcfgContainer [2019-11-16 00:17:08,176 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:17:08,177 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:17:08,177 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:17:08,177 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:17:08,178 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:16:59" (3/4) ... [2019-11-16 00:17:08,181 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:17:08,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:17:08,182 INFO L168 Benchmark]: Toolchain (without parser) took 9535.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 939.4 MB in the beginning and 966.4 MB in the end (delta: -27.1 MB). Peak memory consumption was 194.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:08,183 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:17:08,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 562.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:08,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.45 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-11-16 00:17:08,186 INFO L168 Benchmark]: Boogie Preprocessor took 25.81 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:08,190 INFO L168 Benchmark]: RCFGBuilder took 300.65 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:08,191 INFO L168 Benchmark]: BuchiAutomizer took 8588.18 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 105.4 MB). Free memory was 1.1 GB in the beginning and 974.3 MB in the end (delta: 96.4 MB). Peak memory consumption was 201.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:08,191 INFO L168 Benchmark]: Witness Printer took 4.47 ms. Allocated memory is still 1.3 GB. Free memory was 974.3 MB in the beginning and 966.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:08,198 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 562.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.45 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. * Boogie Preprocessor took 25.81 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 300.65 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8588.18 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 105.4 MB). Free memory was 1.1 GB in the beginning and 974.3 MB in the end (delta: 96.4 MB). Peak memory consumption was 201.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.47 ms. Allocated memory is still 1.3 GB. Free memory was 974.3 MB in the beginning and 966.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. 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 - 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[a] + -1 * a and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[a] + -1 * a and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 90 SDslu, 37 SDs, 0 SdLazy, 73 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital231 mio100 ax100 hnf99 lsp95 ukn80 mio100 lsp39 div100 bol100 ite100 ukn100 eq193 hnf88 smp100 dnf219 smp97 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 63ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 72 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...