./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_871616b5-7972-4402-baf2-2e82af80a995/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_871616b5-7972-4402-baf2-2e82af80a995/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_871616b5-7972-4402-baf2-2e82af80a995/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_871616b5-7972-4402-baf2-2e82af80a995/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_871616b5-7972-4402-baf2-2e82af80a995/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_871616b5-7972-4402-baf2-2e82af80a995/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0116566dfd4e4e63b59200ee97d098541aa6c54d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:51:49,402 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:51:49,404 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:51:49,411 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:51:49,411 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:51:49,412 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:51:49,412 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:51:49,413 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:51:49,414 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:51:49,414 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:51:49,415 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:51:49,415 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:51:49,415 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:51:49,416 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:51:49,417 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:51:49,417 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:51:49,418 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:51:49,419 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:51:49,420 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:51:49,421 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:51:49,421 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:51:49,422 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:51:49,424 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:51:49,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:51:49,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:51:49,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:51:49,425 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:51:49,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:51:49,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:51:49,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:51:49,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:51:49,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:51:49,427 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:51:49,427 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:51:49,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:51:49,428 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:51:49,428 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_871616b5-7972-4402-baf2-2e82af80a995/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 15:51:49,439 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:51:49,439 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:51:49,440 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:51:49,440 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:51:49,440 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:51:49,440 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:51:49,440 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:51:49,440 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:51:49,440 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:51:49,440 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:51:49,441 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:51:49,441 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:51:49,441 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:51:49,441 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:51:49,441 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:51:49,441 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:51:49,441 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:51:49,441 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:51:49,442 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:51:49,442 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:51:49,442 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:51:49,442 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:51:49,442 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:51:49,442 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:51:49,442 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:51:49,442 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:51:49,442 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:51:49,442 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:51:49,443 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:51:49,443 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:51:49,443 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:51:49,443 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:51:49,443 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_871616b5-7972-4402-baf2-2e82af80a995/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0116566dfd4e4e63b59200ee97d098541aa6c54d [2018-11-23 15:51:49,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:51:49,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:51:49,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:51:49,478 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:51:49,478 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:51:49,478 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_871616b5-7972-4402-baf2-2e82af80a995/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-11-23 15:51:49,523 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_871616b5-7972-4402-baf2-2e82af80a995/bin-2019/uautomizer/data/c260af72d/0ae714c51d904d71b07e032210496b5f/FLAG4a054b4b4 [2018-11-23 15:51:49,870 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:51:49,871 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_871616b5-7972-4402-baf2-2e82af80a995/sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-11-23 15:51:49,877 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_871616b5-7972-4402-baf2-2e82af80a995/bin-2019/uautomizer/data/c260af72d/0ae714c51d904d71b07e032210496b5f/FLAG4a054b4b4 [2018-11-23 15:51:49,886 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_871616b5-7972-4402-baf2-2e82af80a995/bin-2019/uautomizer/data/c260af72d/0ae714c51d904d71b07e032210496b5f [2018-11-23 15:51:49,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:51:49,889 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:51:49,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:51:49,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:51:49,892 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:51:49,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:51:49" (1/1) ... [2018-11-23 15:51:49,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693217b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:49, skipping insertion in model container [2018-11-23 15:51:49,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:51:49" (1/1) ... [2018-11-23 15:51:49,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:51:49,927 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:51:50,118 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:51:50,126 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:51:50,195 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:51:50,225 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:51:50,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:50 WrapperNode [2018-11-23 15:51:50,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:51:50,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:51:50,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:51:50,226 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:51:50,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:50" (1/1) ... [2018-11-23 15:51:50,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:50" (1/1) ... [2018-11-23 15:51:50,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:51:50,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:51:50,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:51:50,257 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:51:50,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:50" (1/1) ... [2018-11-23 15:51:50,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:50" (1/1) ... [2018-11-23 15:51:50,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:50" (1/1) ... [2018-11-23 15:51:50,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:50" (1/1) ... [2018-11-23 15:51:50,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:50" (1/1) ... [2018-11-23 15:51:50,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:50" (1/1) ... [2018-11-23 15:51:50,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:50" (1/1) ... [2018-11-23 15:51:50,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:51:50,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:51:50,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:51:50,277 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:51:50,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_871616b5-7972-4402-baf2-2e82af80a995/bin-2019/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 [2018-11-23 15:51:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:51:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:51:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:51:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:51:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:51:50,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:51:50,481 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:51:50,481 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 15:51:50,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:50 BoogieIcfgContainer [2018-11-23 15:51:50,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:51:50,482 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:51:50,482 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:51:50,485 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:51:50,486 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:51:50,486 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:51:49" (1/3) ... [2018-11-23 15:51:50,487 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fde91f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:51:50, skipping insertion in model container [2018-11-23 15:51:50,487 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:51:50,487 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:50" (2/3) ... [2018-11-23 15:51:50,487 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fde91f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:51:50, skipping insertion in model container [2018-11-23 15:51:50,487 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:51:50,487 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:50" (3/3) ... [2018-11-23 15:51:50,489 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-11-23 15:51:50,530 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:51:50,530 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:51:50,531 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:51:50,531 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:51:50,531 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:51:50,531 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:51:50,531 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:51:50,531 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:51:50,531 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:51:50,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-23 15:51:50,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 15:51:50,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:51:50,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:51:50,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:51:50,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 15:51:50,565 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:51:50,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-23 15:51:50,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 15:51:50,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:51:50,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:51:50,567 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:51:50,567 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 15:51:50,572 INFO L794 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~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 3#L558true assume !(main_~length1~0 < 1); 5#L558-2true assume !(main_~length2~0 < 1); 18#L561-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 13#L543-3true [2018-11-23 15:51:50,572 INFO L796 eck$LassoCheckResult]: Loop: 13#L543-3true call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 10#L543-1true assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 12#L546-5true assume !true; 14#L546-6true call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 16#L550true assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 13#L543-3true [2018-11-23 15:51:50,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:50,577 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 15:51:50,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:50,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:50,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:50,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:50,674 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2018-11-23 15:51:50,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:50,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:50,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:50,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:50,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:50,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:50,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:50,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:51:50,699 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:51:50,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:51:50,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:51:50,710 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-11-23 15:51:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:50,714 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-11-23 15:51:50,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:51:50,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-23 15:51:50,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 15:51:50,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2018-11-23 15:51:50,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 15:51:50,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 15:51:50,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-23 15:51:50,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:51:50,721 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 15:51:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-23 15:51:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 15:51:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 15:51:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-11-23 15:51:50,744 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 15:51:50,744 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 15:51:50,745 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:51:50,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-11-23 15:51:50,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 15:51:50,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:51:50,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:51:50,746 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:51:50,746 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:50,746 INFO L794 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 43#L558 assume !(main_~length1~0 < 1); 44#L558-2 assume !(main_~length2~0 < 1); 51#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 52#L543-3 [2018-11-23 15:51:50,746 INFO L796 eck$LassoCheckResult]: Loop: 52#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 45#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 46#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 48#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 53#L546-3 assume !substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5; 49#L546-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 50#L550 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 52#L543-3 [2018-11-23 15:51:50,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:50,747 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 15:51:50,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:50,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:50,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:50,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:50,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:50,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:50,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2018-11-23 15:51:50,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:50,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:50,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:50,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:51:50,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:50,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:50,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2018-11-23 15:51:50,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:50,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:50,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:50,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:50,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:50,997 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-11-23 15:51:51,209 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-23 15:51:51,283 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:51:51,284 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:51:51,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:51:51,284 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:51:51,284 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:51:51,284 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:51:51,284 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:51:51,285 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:51:51,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-23 15:51:51,285 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:51:51,285 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:51:51,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:51,957 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:51:51,960 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:51:51,961 INFO L122 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 [2018-11-23 15:51:51,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:51,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:51,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:51,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,966 INFO L122 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 [2018-11-23 15:51:51,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:51,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:51,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:51,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,969 INFO L122 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 [2018-11-23 15:51:51,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:51,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:51,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,973 INFO L122 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 [2018-11-23 15:51:51,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:51,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:51,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:51,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,975 INFO L122 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 [2018-11-23 15:51:51,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:51,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:51,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,979 INFO L122 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 [2018-11-23 15:51:51,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:51,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:51,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:51,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,981 INFO L122 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 [2018-11-23 15:51:51,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:51,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:51,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:51,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,983 INFO L122 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 [2018-11-23 15:51:51,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:51,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:51,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:51,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,985 INFO L122 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 [2018-11-23 15:51:51,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:51,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:51,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:51,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,987 INFO L122 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 [2018-11-23 15:51:51,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:51,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:51,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:51,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,989 INFO L122 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 [2018-11-23 15:51:51,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:51,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:51,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:51,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,991 INFO L122 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 [2018-11-23 15:51:51,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:51,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:51,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:51,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,993 INFO L122 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 [2018-11-23 15:51:51,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:51,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:51,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:51,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,995 INFO L122 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 [2018-11-23 15:51:51,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:51,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:51,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:51,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,997 INFO L122 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 [2018-11-23 15:51:51,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:51,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:51,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:51,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:51,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:51,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:51,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:51,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:51,999 INFO L122 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 [2018-11-23 15:51:52,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:52,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:52,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:52,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:52,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:52,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:52,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:52,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:52,002 INFO L122 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 [2018-11-23 15:51:52,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:52,002 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:51:52,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:52,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:52,005 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:51:52,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:52,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:52,017 INFO L122 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 [2018-11-23 15:51:52,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:52,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:52,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:52,018 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-23 15:51:52,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:52,020 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:51:52,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:52,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:52,031 INFO L122 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 [2018-11-23 15:51:52,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:52,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:52,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:52,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:52,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:52,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:52,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:52,044 INFO L122 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 [2018-11-23 15:51:52,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:52,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:52,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:52,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:52,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:52,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:52,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:52,048 INFO L122 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 [2018-11-23 15:51:52,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:52,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:52,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:52,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:52,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:52,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:52,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:52,053 INFO L122 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 [2018-11-23 15:51:52,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:52,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:52,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:52,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:52,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:52,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:52,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:52,058 INFO L122 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 [2018-11-23 15:51:52,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:52,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:52,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:52,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:52,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:52,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:52,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:52,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:52,060 INFO L122 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 [2018-11-23 15:51:52,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:52,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:52,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:52,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:52,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:52,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:52,083 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:51:52,100 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 15:51:52,101 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 15:51:52,102 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:51:52,104 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:51:52,104 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:51:52,104 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1, ULTIMATE.start_substring_~ps~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 - 1*ULTIMATE.start_substring_~ps~0.offset Supporting invariants [] [2018-11-23 15:51:52,160 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 15:51:52,167 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:51:52,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:52,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:52,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:52,227 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 [2018-11-23 15:51:52,228 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 15:51:52,276 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 4 states. [2018-11-23 15:51:52,277 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 [2018-11-23 15:51:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:51:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-23 15:51:52,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2018-11-23 15:51:52,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:52,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-23 15:51:52,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:52,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-23 15:51:52,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:52,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-11-23 15:51:52,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:51:52,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2018-11-23 15:51:52,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 15:51:52,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 15:51:52,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-11-23 15:51:52,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:51:52,283 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-23 15:51:52,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-11-23 15:51:52,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 15:51:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 15:51:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-11-23 15:51:52,285 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-23 15:51:52,285 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-23 15:51:52,285 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:51:52,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2018-11-23 15:51:52,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:51:52,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:51:52,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:51:52,286 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:52,287 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:51:52,287 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 171#L558 assume !(main_~length1~0 < 1); 172#L558-2 assume !(main_~length2~0 < 1); 184#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 182#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 173#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 174#L546-5 [2018-11-23 15:51:52,287 INFO L796 eck$LassoCheckResult]: Loop: 174#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 178#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 185#L546-3 assume !!substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 174#L546-5 [2018-11-23 15:51:52,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-11-23 15:51:52,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:52,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:52,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:52,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:52,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:52,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:52,306 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2018-11-23 15:51:52,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:52,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:52,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:52,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:52,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:52,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:52,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2018-11-23 15:51:52,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:52,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:52,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:52,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:52,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:52,669 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2018-11-23 15:51:52,738 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:51:52,739 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:51:52,739 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:51:52,739 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:51:52,739 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:51:52,739 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:51:52,739 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:51:52,739 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:51:52,739 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-23 15:51:52,739 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:51:52,739 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:51:52,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:52,989 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2018-11-23 15:51:53,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:53,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:53,427 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:51:53,427 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:51:53,427 INFO L122 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 [2018-11-23 15:51:53,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,430 INFO L122 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 [2018-11-23 15:51:53,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,432 INFO L122 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 [2018-11-23 15:51:53,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:53,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:53,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,435 INFO L122 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 [2018-11-23 15:51:53,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,436 INFO L122 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 [2018-11-23 15:51:53,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,438 INFO L122 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 [2018-11-23 15:51:53,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,439 INFO L122 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 [2018-11-23 15:51:53,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,441 INFO L122 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 [2018-11-23 15:51:53,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,442 INFO L122 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 [2018-11-23 15:51:53,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,444 INFO L122 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 [2018-11-23 15:51:53,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,447 INFO L122 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 [2018-11-23 15:51:53,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:53,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:53,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,450 INFO L122 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 [2018-11-23 15:51:53,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,451 INFO L122 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 [2018-11-23 15:51:53,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,453 INFO L122 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 [2018-11-23 15:51:53,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,455 INFO L122 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 [2018-11-23 15:51:53,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:53,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:53,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,457 INFO L122 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 [2018-11-23 15:51:53,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,459 INFO L122 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 [2018-11-23 15:51:53,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,461 INFO L122 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 [2018-11-23 15:51:53,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:53,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:53,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:53,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,462 INFO L122 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 [2018-11-23 15:51:53,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:53,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:53,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,465 INFO L122 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 [2018-11-23 15:51:53,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,465 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:51:53,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,467 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:51:53,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:53,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,475 INFO L122 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 [2018-11-23 15:51:53,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:53,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:53,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,477 INFO L122 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 [2018-11-23 15:51:53,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:53,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:53,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,483 INFO L122 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 [2018-11-23 15:51:53,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,483 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:51:53,483 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 15:51:53,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,486 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 15:51:53,486 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:51:53,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,495 INFO L122 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 [2018-11-23 15:51:53,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:53,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:53,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,497 INFO L122 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 [2018-11-23 15:51:53,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,498 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:51:53,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,499 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:51:53,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:53,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:53,505 INFO L122 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 [2018-11-23 15:51:53,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:53,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:53,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:53,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:53,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:53,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:53,533 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:51:53,560 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 15:51:53,560 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 15:51:53,560 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:51:53,561 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:51:53,561 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:51:53,562 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-11-23 15:51:53,626 INFO L297 tatePredicateManager]: 20 out of 23 supporting invariants were superfluous and have been removed [2018-11-23 15:51:53,630 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:51:53,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:53,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:53,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:53,692 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 15:51:53,692 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-23 15:51:53,736 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 59 states and 76 transitions. Complement of second has 8 states. [2018-11-23 15:51:53,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:51:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 15:51:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 15:51:53,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 15:51:53,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:53,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 15:51:53,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:53,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 15:51:53,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:53,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2018-11-23 15:51:53,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 15:51:53,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 48 states and 64 transitions. [2018-11-23 15:51:53,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 15:51:53,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 15:51:53,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2018-11-23 15:51:53,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:51:53,743 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2018-11-23 15:51:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2018-11-23 15:51:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2018-11-23 15:51:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 15:51:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2018-11-23 15:51:53,747 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-11-23 15:51:53,747 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-11-23 15:51:53,747 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:51:53,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2018-11-23 15:51:53,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 15:51:53,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:51:53,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:51:53,748 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:53,748 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:51:53,749 INFO L794 eck$LassoCheckResult]: Stem: 407#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 400#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 401#L558 assume !(main_~length1~0 < 1); 406#L558-2 assume !(main_~length2~0 < 1); 412#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 415#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 402#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 403#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 409#L546-1 [2018-11-23 15:51:53,749 INFO L796 eck$LassoCheckResult]: Loop: 409#L546-1 assume !substring_#t~short6; 419#L546-3 assume !!substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 408#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 409#L546-1 [2018-11-23 15:51:53,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash 180429619, now seen corresponding path program 1 times [2018-11-23 15:51:53,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:53,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:53,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:53,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:53,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:53,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:53,768 INFO L82 PathProgramCache]: Analyzing trace with hash 64727, now seen corresponding path program 1 times [2018-11-23 15:51:53,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:53,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:53,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:53,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:53,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:53,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:53,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:51:53,780 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:51:53,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:51:53,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:53,780 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 20 Second operand 3 states. [2018-11-23 15:51:53,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:53,796 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2018-11-23 15:51:53,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:51:53,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2018-11-23 15:51:53,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:51:53,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 25 states and 32 transitions. [2018-11-23 15:51:53,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 15:51:53,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 15:51:53,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-11-23 15:51:53,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:51:53,799 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-23 15:51:53,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-11-23 15:51:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-23 15:51:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 15:51:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-23 15:51:53,800 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-23 15:51:53,801 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-23 15:51:53,801 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 15:51:53,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-23 15:51:53,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:51:53,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:51:53,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:51:53,805 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:53,805 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:51:53,806 INFO L794 eck$LassoCheckResult]: Stem: 485#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 478#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 479#L558 assume !(main_~length1~0 < 1); 484#L558-2 assume !(main_~length2~0 < 1); 494#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 489#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 482#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 483#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 496#L546-1 assume !substring_#t~short6; 497#L546-3 assume !substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5; 492#L546-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 493#L550 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 490#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 480#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 481#L546-5 [2018-11-23 15:51:53,806 INFO L796 eck$LassoCheckResult]: Loop: 481#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 486#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 495#L546-3 assume !!substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 481#L546-5 [2018-11-23 15:51:53,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:53,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2018-11-23 15:51:53,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:53,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:53,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:53,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:53,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:53,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:53,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:51:53,845 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:51:53,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:53,845 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2018-11-23 15:51:53,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:53,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:53,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:53,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:53,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:53,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:51:53,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:53,939 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-23 15:51:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:53,965 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-23 15:51:53,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:51:53,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-23 15:51:53,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:51:53,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 28 transitions. [2018-11-23 15:51:53,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 15:51:53,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 15:51:53,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-11-23 15:51:53,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:51:53,968 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-23 15:51:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-11-23 15:51:53,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 15:51:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 15:51:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-11-23 15:51:53,970 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-23 15:51:53,970 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-23 15:51:53,970 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 15:51:53,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2018-11-23 15:51:53,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:51:53,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:51:53,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:51:53,972 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:53,972 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:51:53,972 INFO L794 eck$LassoCheckResult]: Stem: 544#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 537#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 538#L558 assume !(main_~length1~0 < 1); 543#L558-2 assume !(main_~length2~0 < 1); 547#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 548#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 549#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 557#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 554#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 555#L546-3 assume !substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5; 551#L546-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 552#L550 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 550#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 539#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 540#L546-5 [2018-11-23 15:51:53,972 INFO L796 eck$LassoCheckResult]: Loop: 540#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 545#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 553#L546-3 assume !!substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 540#L546-5 [2018-11-23 15:51:53,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:53,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2018-11-23 15:51:53,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:53,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:53,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:53,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:51:53,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:53,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:53,996 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2018-11-23 15:51:53,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:53,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:53,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:53,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:51:53,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:54,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:54,005 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2018-11-23 15:51:54,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:54,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:54,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:54,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:51:54,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:54,467 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 138 [2018-11-23 15:51:54,560 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:51:54,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:51:54,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:51:54,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:51:54,560 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:51:54,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:51:54,560 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:51:54,560 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:51:54,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-23 15:51:54,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:51:54,561 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:51:54,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:54,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:54,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:54,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:54,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:54,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:54,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:54,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:54,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:54,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:54,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:54,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:54,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:54,931 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2018-11-23 15:51:55,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:55,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:55,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:55,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:55,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:55,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:55,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:55,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:55,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:55,531 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-23 15:51:55,656 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:51:55,656 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:51:55,656 INFO L122 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 [2018-11-23 15:51:55,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:55,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:55,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,659 INFO L122 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 [2018-11-23 15:51:55,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:55,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:55,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:55,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,661 INFO L122 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 [2018-11-23 15:51:55,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:55,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:55,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:55,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,662 INFO L122 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 [2018-11-23 15:51:55,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:55,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:55,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:55,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,664 INFO L122 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 [2018-11-23 15:51:55,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:55,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:55,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:55,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,665 INFO L122 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 [2018-11-23 15:51:55,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:55,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:55,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:55,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,666 INFO L122 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 [2018-11-23 15:51:55,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:55,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:55,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,669 INFO L122 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 [2018-11-23 15:51:55,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:55,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:55,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:55,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,670 INFO L122 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 [2018-11-23 15:51:55,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:55,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:55,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:55,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,671 INFO L122 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 [2018-11-23 15:51:55,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:55,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:55,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,673 INFO L122 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 [2018-11-23 15:51:55,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:55,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:55,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:55,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,675 INFO L122 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 [2018-11-23 15:51:55,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:55,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:55,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:55,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,676 INFO L122 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 [2018-11-23 15:51:55,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:55,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:55,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,681 INFO L122 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 [2018-11-23 15:51:55,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,681 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:51:55,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,682 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:51:55,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:55,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,688 INFO L122 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 [2018-11-23 15:51:55,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,688 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-23 15:51:55,688 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 15:51:55,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,693 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2018-11-23 15:51:55,693 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:51:55,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,720 INFO L122 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 [2018-11-23 15:51:55,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:55,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:55,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,724 INFO L122 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 [2018-11-23 15:51:55,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:55,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:55,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,726 INFO L122 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 [2018-11-23 15:51:55,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:55,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:55,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,729 INFO L122 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 [2018-11-23 15:51:55,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:55,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:55,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:55,731 INFO L122 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 [2018-11-23 15:51:55,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:55,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:55,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:55,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:55,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:55,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:55,751 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:51:55,765 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 15:51:55,766 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 15:51:55,766 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:51:55,766 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:51:55,767 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:51:55,767 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~ps2~0.offset, v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2) = -1*ULTIMATE.start_substring_~ps2~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2 Supporting invariants [] [2018-11-23 15:51:55,891 INFO L297 tatePredicateManager]: 43 out of 45 supporting invariants were superfluous and have been removed [2018-11-23 15:51:55,894 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:51:55,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:55,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:55,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:55,952 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 15:51:55,952 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-23 15:51:55,985 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 37 states and 43 transitions. Complement of second has 8 states. [2018-11-23 15:51:55,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:51:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 15:51:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-23 15:51:55,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 15:51:55,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:55,986 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:51:56,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:56,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:56,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:56,037 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 15:51:56,038 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-23 15:51:56,064 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 37 states and 43 transitions. Complement of second has 8 states. [2018-11-23 15:51:56,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:51:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 15:51:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-23 15:51:56,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 15:51:56,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:56,065 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:51:56,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:56,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:56,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:56,137 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 15:51:56,137 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-23 15:51:56,164 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 37 states and 44 transitions. Complement of second has 7 states. [2018-11-23 15:51:56,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:51:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 15:51:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 15:51:56,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 15:51:56,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:56,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-23 15:51:56,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:56,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-23 15:51:56,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:56,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-11-23 15:51:56,166 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:51:56,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-11-23 15:51:56,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:51:56,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:51:56,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:51:56,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:51:56,166 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:51:56,166 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:51:56,166 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:51:56,166 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 15:51:56,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:51:56,166 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:51:56,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 15:51:56,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:51:56 BoogieIcfgContainer [2018-11-23 15:51:56,171 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:51:56,171 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:51:56,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:51:56,172 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:51:56,172 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:50" (3/4) ... [2018-11-23 15:51:56,175 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:51:56,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:51:56,176 INFO L168 Benchmark]: Toolchain (without parser) took 6287.60 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.2 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -242.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:51:56,177 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:51:56,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:56,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:56,178 INFO L168 Benchmark]: Boogie Preprocessor took 19.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:51:56,178 INFO L168 Benchmark]: RCFGBuilder took 204.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:56,179 INFO L168 Benchmark]: BuchiAutomizer took 5689.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:51:56,179 INFO L168 Benchmark]: Witness Printer took 3.98 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:56,183 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 204.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5689.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.98 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * ps and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * pt and consists of 5 locations. One nondeterministic module has affine ranking function -1 * ps2 + unknown-#length-unknown[nondetString1] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 103 SDtfs, 95 SDslu, 60 SDs, 0 SdLazy, 104 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital249 mio100 ax100 hnf99 lsp96 ukn85 mio100 lsp40 div100 bol100 ite100 ukn100 eq189 hnf88 smp95 dnf189 smp75 tf100 neg91 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 60 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...