./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_177e3a2f-77d4-492d-a77e-9c7b617aeaee/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_177e3a2f-77d4-492d-a77e-9c7b617aeaee/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_177e3a2f-77d4-492d-a77e-9c7b617aeaee/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_177e3a2f-77d4-492d-a77e-9c7b617aeaee/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_177e3a2f-77d4-492d-a77e-9c7b617aeaee/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_177e3a2f-77d4-492d-a77e-9c7b617aeaee/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-1dbac8b [2018-11-10 07:33:04,218 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:33:04,220 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:33:04,226 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:33:04,226 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:33:04,227 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:33:04,227 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:33:04,229 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:33:04,230 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:33:04,230 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:33:04,231 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:33:04,231 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:33:04,232 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:33:04,233 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:33:04,234 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:33:04,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:33:04,235 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:33:04,236 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:33:04,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:33:04,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:33:04,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:33:04,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:33:04,242 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:33:04,242 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:33:04,242 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:33:04,243 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:33:04,243 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:33:04,244 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:33:04,244 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:33:04,246 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:33:04,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:33:04,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:33:04,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:33:04,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:33:04,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:33:04,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:33:04,248 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_177e3a2f-77d4-492d-a77e-9c7b617aeaee/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 07:33:04,258 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:33:04,258 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:33:04,259 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:33:04,259 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:33:04,259 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:33:04,259 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:33:04,259 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:33:04,259 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:33:04,260 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:33:04,260 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:33:04,260 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:33:04,261 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:33:04,261 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:33:04,261 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:33:04,261 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:33:04,261 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:33:04,261 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:33:04,261 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:33:04,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:33:04,261 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:33:04,262 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:33:04,262 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:33:04,262 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:33:04,262 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:33:04,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:33:04,262 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:33:04,262 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:33:04,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:33:04,262 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:33:04,262 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:33:04,263 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:33:04,263 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_177e3a2f-77d4-492d-a77e-9c7b617aeaee/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-10 07:33:04,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:33:04,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:33:04,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:33:04,299 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:33:04,299 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:33:04,300 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_177e3a2f-77d4-492d-a77e-9c7b617aeaee/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-11-10 07:33:04,342 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_177e3a2f-77d4-492d-a77e-9c7b617aeaee/bin-2019/uautomizer/data/3c20be37d/375af2cc3b014fcba52f4bdc7ddb676b/FLAG1a28b3d4c [2018-11-10 07:33:04,704 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:33:04,704 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_177e3a2f-77d4-492d-a77e-9c7b617aeaee/sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-11-10 07:33:04,711 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_177e3a2f-77d4-492d-a77e-9c7b617aeaee/bin-2019/uautomizer/data/3c20be37d/375af2cc3b014fcba52f4bdc7ddb676b/FLAG1a28b3d4c [2018-11-10 07:33:04,720 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_177e3a2f-77d4-492d-a77e-9c7b617aeaee/bin-2019/uautomizer/data/3c20be37d/375af2cc3b014fcba52f4bdc7ddb676b [2018-11-10 07:33:04,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:33:04,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:33:04,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:33:04,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:33:04,725 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:33:04,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:33:04" (1/1) ... [2018-11-10 07:33:04,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1039c3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:04, skipping insertion in model container [2018-11-10 07:33:04,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:33:04" (1/1) ... [2018-11-10 07:33:04,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:33:04,758 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:33:04,951 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:33:04,958 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:33:04,987 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:33:05,018 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:33:05,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:05 WrapperNode [2018-11-10 07:33:05,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:33:05,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:33:05,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:33:05,019 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:33:05,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:05" (1/1) ... [2018-11-10 07:33:05,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:05" (1/1) ... [2018-11-10 07:33:05,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:33:05,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:33:05,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:33:05,096 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:33:05,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:05" (1/1) ... [2018-11-10 07:33:05,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:05" (1/1) ... [2018-11-10 07:33:05,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:05" (1/1) ... [2018-11-10 07:33:05,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:05" (1/1) ... [2018-11-10 07:33:05,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:05" (1/1) ... [2018-11-10 07:33:05,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:05" (1/1) ... [2018-11-10 07:33:05,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:05" (1/1) ... [2018-11-10 07:33:05,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:33:05,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:33:05,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:33:05,114 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:33:05,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_177e3a2f-77d4-492d-a77e-9c7b617aeaee/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-10 07:33:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:33:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:33:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:33:05,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:33:05,367 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:33:05,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:33:05 BoogieIcfgContainer [2018-11-10 07:33:05,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:33:05,367 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:33:05,368 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:33:05,371 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:33:05,372 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:33:05,372 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:33:04" (1/3) ... [2018-11-10 07:33:05,373 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30a827d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:33:05, skipping insertion in model container [2018-11-10 07:33:05,373 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:33:05,373 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:05" (2/3) ... [2018-11-10 07:33:05,374 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30a827d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:33:05, skipping insertion in model container [2018-11-10 07:33:05,374 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:33:05,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:33:05" (3/3) ... [2018-11-10 07:33:05,375 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-11-10 07:33:05,420 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:33:05,421 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:33:05,421 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:33:05,421 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:33:05,421 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:33:05,421 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:33:05,421 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:33:05,421 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:33:05,421 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:33:05,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 07:33:05,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 07:33:05,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:33:05,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:33:05,467 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:05,467 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:33:05,467 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:33:05,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 07:33:05,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 07:33:05,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:33:05,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:33:05,470 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:05,470 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:33:05,479 INFO L793 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 18#L558true assume !(main_~length1~0 < 1); 22#L558-2true assume !(main_~length2~0 < 1); 15#L561-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 5#L566true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 7#L566-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 20#L567true assume { :begin_inline_substring } true;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; 14#L543-4true [2018-11-10 07:33:05,479 INFO L795 eck$LassoCheckResult]: Loop: 14#L543-4true assume true; 10#L543-1true SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L543-1 11#L543-2true assume !!(substring_#t~mem2 != 0);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; 19#L546-10true assume !true; 21#L546-11true SUMMARY for call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-11 13#L550true assume !(substring_#t~mem9 == 0);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, substring_#t~post10.offset + 1;havoc substring_#t~post10.base, substring_#t~post10.offset; 14#L543-4true [2018-11-10 07:33:05,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:05,484 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 07:33:05,486 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:05,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:05,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:05,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:05,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:05,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:05,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1540425151, now seen corresponding path program 1 times [2018-11-10 07:33:05,614 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:05,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:05,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:05,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:05,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:05,634 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-10 07:33:05,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:33:05,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:33:05,638 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:33:05,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:33:05,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:33:05,649 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-10 07:33:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:33:05,653 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-10 07:33:05,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:33:05,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-11-10 07:33:05,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 07:33:05,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 25 transitions. [2018-11-10 07:33:05,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 07:33:05,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 07:33:05,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2018-11-10 07:33:05,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:33:05,659 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 07:33:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2018-11-10 07:33:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 07:33:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 07:33:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-10 07:33:05,677 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 07:33:05,677 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 07:33:05,677 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:33:05,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-11-10 07:33:05,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 07:33:05,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:33:05,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:33:05,679 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:05,679 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:05,679 INFO L793 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 75#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 60#L558 assume !(main_~length1~0 < 1); 61#L558-2 assume !(main_~length2~0 < 1); 68#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 70#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 71#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 64#L567 assume { :begin_inline_substring } true;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; 65#L543-4 [2018-11-10 07:33:05,679 INFO L795 eck$LassoCheckResult]: Loop: 65#L543-4 assume true; 76#L543-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L543-1 77#L543-2 assume !!(substring_#t~mem2 != 0);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; 62#L546-10 assume true; 63#L546-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-1 69#L546-2 substring_#t~short6 := substring_#t~mem3 != 0; 72#L546-3 assume !substring_#t~short6; 74#L546-8 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~short6;havoc substring_#t~mem5; 66#L546-11 SUMMARY for call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-11 67#L550 assume !(substring_#t~mem9 == 0);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, substring_#t~post10.offset + 1;havoc substring_#t~post10.base, substring_#t~post10.offset; 65#L543-4 [2018-11-10 07:33:05,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:05,680 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 07:33:05,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:05,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:05,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:05,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:05,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:05,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:05,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1301820241, now seen corresponding path program 1 times [2018-11-10 07:33:05,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:05,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:05,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:05,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:33:05,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:05,768 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-10 07:33:05,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:33:05,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:33:05,768 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:33:05,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:33:05,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:33:05,769 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-10 07:33:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:33:05,859 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-10 07:33:05,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:33:05,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-11-10 07:33:05,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 07:33:05,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 26 transitions. [2018-11-10 07:33:05,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 07:33:05,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 07:33:05,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-11-10 07:33:05,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:33:05,861 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 07:33:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-11-10 07:33:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-10 07:33:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 07:33:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-10 07:33:05,862 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 07:33:05,862 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 07:33:05,862 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:33:05,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2018-11-10 07:33:05,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 07:33:05,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:33:05,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:33:05,863 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:05,863 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:05,863 INFO L793 eck$LassoCheckResult]: Stem: 139#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 135#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 120#L558 assume !(main_~length1~0 < 1); 121#L558-2 assume !(main_~length2~0 < 1); 128#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 130#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 131#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 124#L567 assume { :begin_inline_substring } true;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; 125#L543-4 [2018-11-10 07:33:05,864 INFO L795 eck$LassoCheckResult]: Loop: 125#L543-4 assume true; 136#L543-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L543-1 137#L543-2 assume !!(substring_#t~mem2 != 0);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; 122#L546-10 assume true; 123#L546-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-1 129#L546-2 substring_#t~short6 := substring_#t~mem3 != 0; 132#L546-3 assume substring_#t~short6; 133#L546-4 SUMMARY for call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-4 138#L546-5 SUMMARY for call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1); srcloc: L546-5 140#L546-6 substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 141#L546-8 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~short6;havoc substring_#t~mem5; 126#L546-11 SUMMARY for call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-11 127#L550 assume !(substring_#t~mem9 == 0);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, substring_#t~post10.offset + 1;havoc substring_#t~post10.base, substring_#t~post10.offset; 125#L543-4 [2018-11-10 07:33:05,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:05,864 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 3 times [2018-11-10 07:33:05,864 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:05,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:05,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:05,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:05,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:05,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:05,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1411931925, now seen corresponding path program 1 times [2018-11-10 07:33:05,883 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:05,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:05,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:05,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:33:05,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:05,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:05,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1729135105, now seen corresponding path program 1 times [2018-11-10 07:33:05,899 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:05,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:05,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:05,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:05,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:06,105 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-11-10 07:33:06,346 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-11-10 07:33:06,434 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:33:06,435 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:33:06,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:33:06,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:33:06,436 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:33:06,436 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:33:06,436 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:33:06,436 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:33:06,436 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 07:33:06,436 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:33:06,437 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:33:06,456 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-10 07:33:06,460 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-10 07:33:06,462 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-10 07:33:06,465 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-10 07:33:06,466 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-10 07:33:06,468 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-10 07:33:06,470 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-10 07:33:06,471 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-10 07:33:06,474 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-10 07:33:06,475 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-10 07:33:06,477 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-10 07:33:06,478 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-10 07:33:06,480 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-10 07:33:06,481 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-10 07:33:06,483 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-10 07:33:06,484 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-10 07:33:06,486 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-10 07:33:06,487 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-10 07:33:06,754 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-11-10 07:33:06,859 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-10 07:33:06,860 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-10 07:33:07,273 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:33:07,278 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:33:07,279 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-10 07:33:07,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,285 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-10 07:33:07,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,287 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,288 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-10 07:33:07,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:07,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:07,293 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,294 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-10 07:33:07,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,296 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,302 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-10 07:33:07,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:07,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:07,307 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,308 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-10 07:33:07,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,310 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-10 07:33:07,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,312 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,313 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-10 07:33:07,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,315 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-10 07:33:07,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,317 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,318 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-10 07:33:07,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,319 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,320 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-10 07:33:07,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,322 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-10 07:33:07,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,324 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,325 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-10 07:33:07,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,327 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,328 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-10 07:33:07,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,330 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-10 07:33:07,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,333 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-10 07:33:07,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,335 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-10 07:33:07,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:07,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,337 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,337 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-10 07:33:07,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:07,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:07,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,342 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-10 07:33:07,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:07,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:07,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,359 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-10 07:33:07,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:07,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:07,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,363 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-10 07:33:07,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:07,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,364 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-10 07:33:07,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,366 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 07:33:07,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:07,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:07,377 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-10 07:33:07,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:07,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:07,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:07,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:07,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:07,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:07,408 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:33:07,437 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 07:33:07,437 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 07:33:07,439 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:33:07,441 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:33:07,441 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:33:07,441 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~ps~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1) = -1*ULTIMATE.start_substring_~ps~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 Supporting invariants [] [2018-11-10 07:33:07,477 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 07:33:07,484 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:33:07,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:07,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:07,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:07,553 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-10 07:33:07,555 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-10 07:33:07,556 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-10 07:33:07,609 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 36 states and 43 transitions. Complement of second has 7 states. [2018-11-10 07:33:07,610 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-10 07:33:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 07:33:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-10 07:33:07,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 8 letters. Loop has 13 letters. [2018-11-10 07:33:07,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:33:07,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 21 letters. Loop has 13 letters. [2018-11-10 07:33:07,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:33:07,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 8 letters. Loop has 26 letters. [2018-11-10 07:33:07,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:33:07,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2018-11-10 07:33:07,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 07:33:07,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 41 transitions. [2018-11-10 07:33:07,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 07:33:07,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 07:33:07,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2018-11-10 07:33:07,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:33:07,616 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-10 07:33:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2018-11-10 07:33:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-10 07:33:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 07:33:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-10 07:33:07,620 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-10 07:33:07,620 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-10 07:33:07,620 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:33:07,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2018-11-10 07:33:07,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 07:33:07,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:33:07,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:33:07,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:07,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:33:07,621 INFO L793 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 308#L558 assume !(main_~length1~0 < 1); 309#L558-2 assume !(main_~length2~0 < 1); 318#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 321#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 322#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 314#L567 assume { :begin_inline_substring } true;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; 315#L543-4 assume true; 330#L543-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L543-1 331#L543-2 assume !!(substring_#t~mem2 != 0);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; 310#L546-10 [2018-11-10 07:33:07,621 INFO L795 eck$LassoCheckResult]: Loop: 310#L546-10 assume true; 311#L546-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-1 319#L546-2 substring_#t~short6 := substring_#t~mem3 != 0; 323#L546-3 assume !substring_#t~short6; 326#L546-8 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~short6;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, substring_#t~post7.offset + 1;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, substring_#t~post8.offset + 1;havoc substring_#t~post8.base, substring_#t~post8.offset; 310#L546-10 [2018-11-10 07:33:07,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:07,621 INFO L82 PathProgramCache]: Analyzing trace with hash 2052451984, now seen corresponding path program 1 times [2018-11-10 07:33:07,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:07,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:07,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:07,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:07,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:07,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:07,643 INFO L82 PathProgramCache]: Analyzing trace with hash 60184039, now seen corresponding path program 1 times [2018-11-10 07:33:07,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:07,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:07,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:07,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:07,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:07,659 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-10 07:33:07,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:33:07,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:33:07,659 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:33:07,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:33:07,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:33:07,660 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-10 07:33:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:33:07,678 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-10 07:33:07,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:33:07,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2018-11-10 07:33:07,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 07:33:07,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 37 transitions. [2018-11-10 07:33:07,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 07:33:07,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 07:33:07,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2018-11-10 07:33:07,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:33:07,681 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-10 07:33:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2018-11-10 07:33:07,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-10 07:33:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 07:33:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-10 07:33:07,683 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-10 07:33:07,683 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-10 07:33:07,683 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:33:07,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-11-10 07:33:07,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 07:33:07,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:33:07,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:33:07,684 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:07,684 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:07,685 INFO L793 eck$LassoCheckResult]: Stem: 407#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 381#L558 assume !(main_~length1~0 < 1); 382#L558-2 assume !(main_~length2~0 < 1); 391#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 394#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 395#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 387#L567 assume { :begin_inline_substring } true;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; 388#L543-4 assume true; 401#L543-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L543-1 402#L543-2 assume !!(substring_#t~mem2 != 0);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; 383#L546-10 [2018-11-10 07:33:07,685 INFO L795 eck$LassoCheckResult]: Loop: 383#L546-10 assume true; 384#L546-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-1 392#L546-2 substring_#t~short6 := substring_#t~mem3 != 0; 396#L546-3 assume substring_#t~short6; 398#L546-4 SUMMARY for call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-4 405#L546-5 SUMMARY for call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1); srcloc: L546-5 408#L546-6 substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 410#L546-8 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~short6;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, substring_#t~post7.offset + 1;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, substring_#t~post8.offset + 1;havoc substring_#t~post8.base, substring_#t~post8.offset; 383#L546-10 [2018-11-10 07:33:07,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:07,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2052451984, now seen corresponding path program 2 times [2018-11-10 07:33:07,693 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:07,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:07,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:07,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:07,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:07,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:07,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1936468655, now seen corresponding path program 1 times [2018-11-10 07:33:07,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:07,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:07,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:07,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:33:07,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:07,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:07,716 INFO L82 PathProgramCache]: Analyzing trace with hash 976099902, now seen corresponding path program 1 times [2018-11-10 07:33:07,716 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:07,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:07,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:07,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:07,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:08,021 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2018-11-10 07:33:08,101 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:33:08,101 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:33:08,101 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:33:08,101 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:33:08,102 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:33:08,102 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:33:08,102 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:33:08,102 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:33:08,102 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-10 07:33:08,102 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:33:08,102 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:33:08,105 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-10 07:33:08,110 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-10 07:33:08,112 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-10 07:33:08,113 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-10 07:33:08,114 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-10 07:33:08,116 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-10 07:33:08,117 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-10 07:33:08,118 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-10 07:33:08,119 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-10 07:33:08,121 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-10 07:33:08,122 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-10 07:33:08,124 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-10 07:33:08,126 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-10 07:33:08,128 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-10 07:33:08,129 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-10 07:33:08,131 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-10 07:33:08,137 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-10 07:33:08,138 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-10 07:33:08,442 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 104 [2018-11-10 07:33:08,556 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2018-11-10 07:33:08,556 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-10 07:33:08,557 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-10 07:33:08,980 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:33:08,980 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:33:08,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-10 07:33:08,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:08,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:08,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:08,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:08,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:08,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:08,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:08,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:08,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-10 07:33:08,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:08,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:08,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:08,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:08,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:08,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:08,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:08,984 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:08,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-10 07:33:08,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:08,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:08,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:08,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:08,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:08,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:08,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:08,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-10 07:33:08,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:08,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:08,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:08,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:08,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:08,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:08,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:08,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:08,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-10 07:33:08,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:08,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:08,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:08,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:08,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:08,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:08,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:08,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:08,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-10 07:33:08,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:08,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:08,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:08,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:08,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:08,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:08,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:08,992 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:08,992 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-10 07:33:08,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:08,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:08,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:08,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:08,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:08,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:08,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:08,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:08,994 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-10 07:33:08,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:08,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:08,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:08,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:08,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:08,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:08,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:08,995 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:08,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-10 07:33:08,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:08,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:08,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:08,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:08,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:08,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:08,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:08,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:08,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-10 07:33:08,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:08,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:08,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:08,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:08,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:08,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:08,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:08,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:08,998 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-10 07:33:08,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:08,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:08,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:08,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:08,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:09,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:09,001 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:09,001 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-10 07:33:09,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:09,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:09,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:09,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:09,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:09,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:09,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:09,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:09,003 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-10 07:33:09,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:09,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:09,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:09,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:09,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:09,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:09,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:09,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:09,004 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-10 07:33:09,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:09,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:09,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:09,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:09,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:09,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:09,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:09,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:09,006 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-10 07:33:09,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:09,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:09,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:09,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:09,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:09,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:09,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:09,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:09,008 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-10 07:33:09,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:09,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:09,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:09,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:09,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:09,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:09,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:09,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:09,009 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-10 07:33:09,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:09,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:09,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:09,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:09,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:09,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:09,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:09,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:09,011 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-10 07:33:09,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:09,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:09,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:09,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:09,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:09,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:09,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:09,014 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-10 07:33:09,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:09,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:09,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:09,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:09,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:09,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:09,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:09,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-10 07:33:09,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:09,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:09,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:09,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:09,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:09,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:09,054 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:33:09,080 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 07:33:09,081 INFO L444 ModelExtractionUtils]: 54 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 07:33:09,081 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:33:09,082 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:33:09,082 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:33:09,082 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-11-10 07:33:09,159 INFO L297 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2018-11-10 07:33:09,161 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:33:09,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:33:09,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 07:33:09,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:09,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:09,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:09,226 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-10 07:33:09,227 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-10 07:33:09,227 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-10 07:33:09,301 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 81 states and 89 transitions. Complement of second has 9 states. [2018-11-10 07:33:09,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:33:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 07:33:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-10 07:33:09,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-10 07:33:09,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:33:09,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 19 letters. Loop has 8 letters. [2018-11-10 07:33:09,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:33:09,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 11 letters. Loop has 16 letters. [2018-11-10 07:33:09,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:33:09,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 89 transitions. [2018-11-10 07:33:09,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 07:33:09,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 56 states and 62 transitions. [2018-11-10 07:33:09,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 07:33:09,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 07:33:09,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 62 transitions. [2018-11-10 07:33:09,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:33:09,304 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-11-10 07:33:09,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 62 transitions. [2018-11-10 07:33:09,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2018-11-10 07:33:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 07:33:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-10 07:33:09,308 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-10 07:33:09,308 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-10 07:33:09,308 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:33:09,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 54 transitions. [2018-11-10 07:33:09,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 07:33:09,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:33:09,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:33:09,309 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:09,309 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:09,309 INFO L793 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 691#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 671#L558 assume !(main_~length1~0 < 1); 672#L558-2 assume !(main_~length2~0 < 1); 682#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 685#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 686#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 680#L567 assume { :begin_inline_substring } true;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; 681#L543-4 assume true; 706#L543-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L543-1 700#L543-2 assume !!(substring_#t~mem2 != 0);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; 675#L546-10 assume true; 677#L546-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-1 684#L546-2 substring_#t~short6 := substring_#t~mem3 != 0; 688#L546-3 assume substring_#t~short6; 690#L546-4 SUMMARY for call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-4 713#L546-5 SUMMARY for call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1); srcloc: L546-5 711#L546-6 substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 707#L546-8 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~short6;havoc substring_#t~mem5; 678#L546-11 SUMMARY for call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-11 679#L550 assume !(substring_#t~mem9 == 0);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, substring_#t~post10.offset + 1;havoc substring_#t~post10.base, substring_#t~post10.offset; 705#L543-4 assume true; 692#L543-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L543-1 693#L543-2 assume !!(substring_#t~mem2 != 0);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; 673#L546-10 [2018-11-10 07:33:09,310 INFO L795 eck$LassoCheckResult]: Loop: 673#L546-10 assume true; 674#L546-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-1 683#L546-2 substring_#t~short6 := substring_#t~mem3 != 0; 687#L546-3 assume substring_#t~short6; 689#L546-4 SUMMARY for call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-4 696#L546-5 SUMMARY for call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1); srcloc: L546-5 701#L546-6 substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 703#L546-8 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~short6;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, substring_#t~post7.offset + 1;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, substring_#t~post8.offset + 1;havoc substring_#t~post8.base, substring_#t~post8.offset; 673#L546-10 [2018-11-10 07:33:09,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:09,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1173813254, now seen corresponding path program 2 times [2018-11-10 07:33:09,310 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:09,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:09,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:09,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:09,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:09,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:09,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1936468655, now seen corresponding path program 2 times [2018-11-10 07:33:09,331 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:09,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:09,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:09,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:33:09,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:09,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:09,339 INFO L82 PathProgramCache]: Analyzing trace with hash 705571240, now seen corresponding path program 1 times [2018-11-10 07:33:09,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:09,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:09,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:09,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:33:09,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:09,956 WARN L179 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 147 [2018-11-10 07:33:10,056 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:33:10,056 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:33:10,056 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:33:10,056 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:33:10,056 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:33:10,056 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:33:10,056 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:33:10,056 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:33:10,056 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-10 07:33:10,056 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:33:10,056 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:33:10,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-10 07:33:10,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-10 07:33:10,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-10 07:33:10,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-10 07:33:10,065 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-10 07:33:10,066 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-10 07:33:10,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-10 07:33:10,068 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-10 07:33:10,069 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-10 07:33:10,512 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 123 [2018-11-10 07:33:10,673 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-11-10 07:33:10,674 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-10 07:33:10,675 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-10 07:33:10,676 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-10 07:33:10,678 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-10 07:33:10,679 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-10 07:33:10,680 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-10 07:33:10,681 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-10 07:33:10,683 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-10 07:33:10,684 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-10 07:33:10,685 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-10 07:33:10,686 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-10 07:33:10,687 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-10 07:33:10,860 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-11-10 07:33:11,176 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-10 07:33:11,413 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:33:11,413 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:33:11,413 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-10 07:33:11,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:11,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:11,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:11,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:11,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:11,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:11,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:11,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:11,416 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-10 07:33:11,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:11,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:11,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:11,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:11,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:11,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:11,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:11,417 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:11,418 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-10 07:33:11,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:11,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:11,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:11,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:11,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:11,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:11,420 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:11,420 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-10 07:33:11,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:11,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:11,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:11,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:11,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:11,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:11,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:11,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:11,422 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-10 07:33:11,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:11,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:11,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:11,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:11,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:11,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:11,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:11,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:11,424 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-10 07:33:11,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:11,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:11,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:11,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:11,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:11,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:11,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:11,425 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:11,425 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-10 07:33:11,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:11,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:11,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:11,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:11,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:11,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:11,427 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:11,428 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-10 07:33:11,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:11,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:33:11,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:11,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:11,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:11,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:33:11,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:33:11,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:11,429 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-10 07:33:11,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:11,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:11,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:11,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:11,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:11,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:11,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:11,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-10 07:33:11,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:11,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:11,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:11,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:11,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:11,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:11,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:11,443 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-10 07:33:11,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:11,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:11,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:11,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:11,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:11,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:11,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:11,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-10 07:33:11,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:11,451 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-10 07:33:11,451 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:33:11,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:11,459 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2018-11-10 07:33:11,459 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 07:33:11,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:11,480 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-10 07:33:11,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:11,481 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:33:11,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:11,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:11,485 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:33:11,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:11,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:33:11,491 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-10 07:33:11,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:33:11,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:33:11,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:33:11,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:33:11,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:33:11,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:33:11,531 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:33:11,562 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-10 07:33:11,562 INFO L444 ModelExtractionUtils]: 60 out of 67 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 07:33:11,562 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:33:11,563 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:33:11,563 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:33:11,563 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_3, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_3 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-11-10 07:33:11,667 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-10 07:33:11,668 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:33:11,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:11,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:11,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:11,713 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-10 07:33:11,714 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-10 07:33:11,714 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 07:33:11,735 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 77 states and 83 transitions. Complement of second has 7 states. [2018-11-10 07:33:11,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:33:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:33:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-10 07:33:11,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 24 letters. Loop has 8 letters. [2018-11-10 07:33:11,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:33:11,738 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:33:11,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:11,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:11,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:11,784 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-10 07:33:11,784 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 07:33:11,784 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 07:33:11,801 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 77 states and 83 transitions. Complement of second has 7 states. [2018-11-10 07:33:11,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:33:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:33:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-10 07:33:11,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 24 letters. Loop has 8 letters. [2018-11-10 07:33:11,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:33:11,804 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:33:11,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:11,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:11,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:33:11,843 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-10 07:33:11,843 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 07:33:11,844 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 07:33:11,859 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 85 states and 92 transitions. Complement of second has 6 states. [2018-11-10 07:33:11,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:33:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:33:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-10 07:33:11,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 24 letters. Loop has 8 letters. [2018-11-10 07:33:11,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:33:11,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 32 letters. Loop has 8 letters. [2018-11-10 07:33:11,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:33:11,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 24 letters. Loop has 16 letters. [2018-11-10 07:33:11,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:33:11,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-11-10 07:33:11,864 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:33:11,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2018-11-10 07:33:11,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:33:11,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:33:11,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:33:11,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:33:11,865 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:33:11,865 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:33:11,865 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:33:11,865 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 07:33:11,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:33:11,865 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:33:11,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:33:11,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:33:11 BoogieIcfgContainer [2018-11-10 07:33:11,873 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:33:11,873 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:33:11,873 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:33:11,874 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:33:11,874 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:33:05" (3/4) ... [2018-11-10 07:33:11,876 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:33:11,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:33:11,877 INFO L168 Benchmark]: Toolchain (without parser) took 7155.31 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 385.9 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -220.9 MB). Peak memory consumption was 164.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:33:11,878 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:33:11,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.63 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 935.0 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:33:11,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 935.0 MB in the beginning and 1.2 GB in the end (delta: -238.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:33:11,879 INFO L168 Benchmark]: Boogie Preprocessor took 18.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:33:11,879 INFO L168 Benchmark]: RCFGBuilder took 253.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:33:11,880 INFO L168 Benchmark]: BuchiAutomizer took 6505.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -34.9 MB). Peak memory consumption was 171.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:33:11,880 INFO L168 Benchmark]: Witness Printer took 3.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:33:11,883 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.63 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 935.0 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 935.0 MB in the beginning and 1.2 GB in the end (delta: -238.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 253.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6505.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -34.9 MB). Peak memory consumption was 171.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * 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 #Ultimate.alloc_#res - 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 -1 * ps + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * pt and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[pt] + -1 * pt and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 182 SDtfs, 193 SDslu, 105 SDs, 0 SdLazy, 113 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital254 mio100 ax100 hnf99 lsp97 ukn104 mio100 lsp37 div100 bol100 ite100 ukn100 eq200 hnf87 smp97 dnf157 smp78 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms 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...