./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-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_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/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 37ce12f320cb92b62d01decbfb4f63ee1143a42a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:00:51,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:00:51,161 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:00:51,169 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:00:51,169 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:00:51,170 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:00:51,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:00:51,172 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:00:51,173 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:00:51,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:00:51,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:00:51,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:00:51,175 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:00:51,176 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:00:51,177 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:00:51,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:00:51,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:00:51,179 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:00:51,180 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:00:51,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:00:51,182 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:00:51,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:00:51,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:00:51,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:00:51,185 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:00:51,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:00:51,187 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:00:51,187 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:00:51,188 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:00:51,188 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:00:51,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:00:51,189 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:00:51,189 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:00:51,190 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:00:51,190 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:00:51,191 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:00:51,191 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 12:00:51,202 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:00:51,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:00:51,204 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:00:51,204 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:00:51,204 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:00:51,204 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:00:51,204 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:00:51,204 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:00:51,205 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:00:51,205 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:00:51,205 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:00:51,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:00:51,205 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:00:51,205 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:00:51,206 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:00:51,206 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:00:51,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:00:51,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:00:51,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:00:51,206 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:00:51,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:00:51,207 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:00:51,207 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:00:51,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:00:51,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:00:51,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:00:51,207 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:00:51,208 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:00:51,208 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:00:51,208 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:00:51,208 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:00:51,209 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_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/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 -> 37ce12f320cb92b62d01decbfb4f63ee1143a42a [2018-11-10 12:00:51,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:00:51,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:00:51,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:00:51,244 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:00:51,244 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:00:51,245 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-10 12:00:51,284 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/bin-2019/uautomizer/data/3b3b2a3d4/d0cd6a2baa1849db951daae92f047c43/FLAG6fd92cf7c [2018-11-10 12:00:51,649 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:00:51,650 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-10 12:00:51,657 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/bin-2019/uautomizer/data/3b3b2a3d4/d0cd6a2baa1849db951daae92f047c43/FLAG6fd92cf7c [2018-11-10 12:00:51,670 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/bin-2019/uautomizer/data/3b3b2a3d4/d0cd6a2baa1849db951daae92f047c43 [2018-11-10 12:00:51,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:00:51,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:00:51,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:00:51,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:00:51,677 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:00:51,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:00:51" (1/1) ... [2018-11-10 12:00:51,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5970c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:51, skipping insertion in model container [2018-11-10 12:00:51,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:00:51" (1/1) ... [2018-11-10 12:00:51,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:00:51,721 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:00:51,929 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:00:51,938 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:00:51,966 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:00:51,988 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:00:51,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:51 WrapperNode [2018-11-10 12:00:51,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:00:51,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:00:51,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:00:51,989 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:00:51,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:51" (1/1) ... [2018-11-10 12:00:52,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:51" (1/1) ... [2018-11-10 12:00:52,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:00:52,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:00:52,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:00:52,059 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:00:52,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:51" (1/1) ... [2018-11-10 12:00:52,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:51" (1/1) ... [2018-11-10 12:00:52,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:51" (1/1) ... [2018-11-10 12:00:52,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:51" (1/1) ... [2018-11-10 12:00:52,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:51" (1/1) ... [2018-11-10 12:00:52,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:51" (1/1) ... [2018-11-10 12:00:52,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:51" (1/1) ... [2018-11-10 12:00:52,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:00:52,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:00:52,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:00:52,079 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:00:52,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/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 12:00:52,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:00:52,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:00:52,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:00:52,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:00:52,262 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:00:52,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:00:52 BoogieIcfgContainer [2018-11-10 12:00:52,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:00:52,263 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:00:52,263 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:00:52,266 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:00:52,267 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:00:52,267 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:00:51" (1/3) ... [2018-11-10 12:00:52,268 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24b616cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:00:52, skipping insertion in model container [2018-11-10 12:00:52,268 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:00:52,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:51" (2/3) ... [2018-11-10 12:00:52,268 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24b616cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:00:52, skipping insertion in model container [2018-11-10 12:00:52,269 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:00:52,269 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:00:52" (3/3) ... [2018-11-10 12:00:52,270 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-10 12:00:52,314 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:00:52,315 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:00:52,315 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:00:52,315 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:00:52,315 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:00:52,315 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:00:52,316 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:00:52,316 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:00:52,316 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:00:52,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 12:00:52,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 12:00:52,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:00:52,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:00:52,347 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:00:52,347 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:00:52,347 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:00:52,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 12:00:52,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 12:00:52,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:00:52,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:00:52,349 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:00:52,349 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:00:52,354 INFO L793 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 7#L555true assume !(main_~length1~0 < 1); 14#L555-2true assume !(main_~length2~0 < 1); 4#L558-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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.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~malloc9.base, main_#t~malloc9.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~malloc9.base, main_#t~malloc9.offset; 17#L563true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L563 20#L563-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L563-1 13#L564true assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 21#L546-6true [2018-11-10 12:00:52,355 INFO L795 eck$LassoCheckResult]: Loop: 21#L546-6true assume true; 8#L545-1true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 10#L545-2true SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L545-2 15#L545-3true cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 18#L545-4true assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 19#L546-5true assume !true; 21#L546-6true [2018-11-10 12:00:52,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:52,358 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 12:00:52,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:00:52,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:00:52,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:52,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:00:52,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:52,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:52,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1540280279, now seen corresponding path program 1 times [2018-11-10 12:00:52,457 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:00:52,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:00:52,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:52,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:00:52,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:52,479 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 12:00:52,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:00:52,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-10 12:00:52,482 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:00:52,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:00:52,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:00:52,493 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-10 12:00:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:00:52,498 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-10 12:00:52,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:00:52,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 27 transitions. [2018-11-10 12:00:52,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 12:00:52,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 21 transitions. [2018-11-10 12:00:52,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 12:00:52,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 12:00:52,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-10 12:00:52,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:00:52,506 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-10 12:00:52,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-10 12:00:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-10 12:00:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 12:00:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-10 12:00:52,530 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-10 12:00:52,530 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-10 12:00:52,530 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:00:52,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-10 12:00:52,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 12:00:52,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:00:52,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:00:52,531 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:00:52,532 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:00:52,532 INFO L793 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 67#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 60#L555 assume !(main_~length1~0 < 1); 61#L555-2 assume !(main_~length2~0 < 1); 56#L558-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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.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~malloc9.base, main_#t~malloc9.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~malloc9.base, main_#t~malloc9.offset; 57#L563 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L563 70#L563-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L563-1 68#L564 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 66#L546-6 [2018-11-10 12:00:52,532 INFO L795 eck$LassoCheckResult]: Loop: 66#L546-6 assume true; 62#L545-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 63#L545-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L545-2 65#L545-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 69#L545-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 55#L546-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 58#L546-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L546-1 59#L546-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 64#L546-3 assume !(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 66#L546-6 [2018-11-10 12:00:52,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:52,532 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 12:00:52,533 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:00:52,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:00:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:52,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:00:52,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:52,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:52,561 INFO L82 PathProgramCache]: Analyzing trace with hash -941209857, now seen corresponding path program 1 times [2018-11-10 12:00:52,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:00:52,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:00:52,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:52,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:00:52,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:52,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:52,577 INFO L82 PathProgramCache]: Analyzing trace with hash -843635947, now seen corresponding path program 1 times [2018-11-10 12:00:52,577 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:00:52,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:00:52,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:52,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:00:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:52,725 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-10 12:00:52,969 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-10 12:00:53,051 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:00:53,052 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:00:53,052 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:00:53,052 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:00:53,052 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:00:53,053 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:00:53,053 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:00:53,053 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:00:53,053 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-10 12:00:53,053 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:00:53,053 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:00:53,076 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 12:00:53,080 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 12:00:53,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:00:53,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:00:53,085 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 12:00:53,088 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 12:00:53,090 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 12:00:53,096 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 12:00:53,098 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 12:00:53,102 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 12:00:53,103 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 12:00:53,375 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2018-11-10 12:00:53,452 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 12:00:53,454 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 12:00:53,455 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 12:00:53,457 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 12:00:53,458 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 12:00:53,842 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:00:53,845 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:00:53,847 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 12:00:53,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:53,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:00:53,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:53,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:53,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:53,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:00:53,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:00:53,852 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:53,853 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 12:00:53,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:53,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:00:53,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:53,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:53,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:53,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:00:53,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:00:53,855 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:53,856 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 12:00:53,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:53,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:00:53,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:53,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:53,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:53,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:00:53,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:00:53,858 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:53,858 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 12:00:53,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:53,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:00:53,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:53,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:53,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:53,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:00:53,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:00:53,860 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:53,861 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 12:00:53,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:53,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:53,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:53,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:53,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:00:53,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:53,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:53,866 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 12:00:53,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:53,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:00:53,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:53,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:53,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:53,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:00:53,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:00:53,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:53,867 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 12:00:53,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:53,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:00:53,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:53,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:53,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:53,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:00:53,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:00:53,868 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:53,869 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 12:00:53,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:53,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:00:53,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:53,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:53,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:53,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:00:53,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:00:53,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:53,870 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 12:00:53,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:53,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:53,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:53,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:53,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:00:53,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:53,876 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:53,877 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 12:00:53,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:53,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:00:53,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:53,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:53,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:53,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:00:53,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:00:53,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:53,879 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 12:00:53,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:53,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:00:53,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:53,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:53,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:53,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:00:53,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:00:53,885 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:53,885 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 12:00:53,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:53,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:53,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:53,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:53,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:00:53,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:53,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:53,889 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 12:00:53,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:53,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:53,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:53,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:53,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:00:53,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:53,956 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:00:53,988 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 12:00:53,989 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 12:00:53,991 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:00:53,992 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:00:53,992 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:00:53,993 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_cstrpbrk_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_cstrpbrk_~s1.offset Supporting invariants [] [2018-11-10 12:00:54,044 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 12:00:54,051 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:00:54,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:54,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:00:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:54,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:00:54,158 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 12:00:54,160 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 12:00:54,161 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-10 12:00:54,227 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 29 states and 34 transitions. Complement of second has 7 states. [2018-11-10 12:00:54,227 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 12:00:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 12:00:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-10 12:00:54,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 9 letters. [2018-11-10 12:00:54,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:00:54,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 17 letters. Loop has 9 letters. [2018-11-10 12:00:54,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:00:54,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 18 letters. [2018-11-10 12:00:54,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:00:54,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2018-11-10 12:00:54,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 12:00:54,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 29 transitions. [2018-11-10 12:00:54,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 12:00:54,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 12:00:54,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2018-11-10 12:00:54,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:00:54,233 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-10 12:00:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2018-11-10 12:00:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 12:00:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 12:00:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-10 12:00:54,234 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-10 12:00:54,234 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-10 12:00:54,234 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:00:54,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-11-10 12:00:54,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 12:00:54,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:00:54,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:00:54,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:00:54,235 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 12:00:54,236 INFO L793 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 238#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 230#L555 assume !(main_~length1~0 < 1); 231#L555-2 assume !(main_~length2~0 < 1); 224#L558-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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.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~malloc9.base, main_#t~malloc9.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~malloc9.base, main_#t~malloc9.offset; 225#L563 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L563 244#L563-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L563-1 239#L564 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 240#L546-6 assume true; 232#L545-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 233#L545-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L545-2 236#L545-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 242#L545-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 221#L546-5 [2018-11-10 12:00:54,236 INFO L795 eck$LassoCheckResult]: Loop: 221#L546-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 226#L546-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L546-1 227#L546-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 234#L546-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 220#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 221#L546-5 [2018-11-10 12:00:54,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:54,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1016364753, now seen corresponding path program 1 times [2018-11-10 12:00:54,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:00:54,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:00:54,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:54,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:00:54,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:54,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:54,258 INFO L82 PathProgramCache]: Analyzing trace with hash 62061768, now seen corresponding path program 1 times [2018-11-10 12:00:54,258 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:00:54,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:00:54,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:54,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:00:54,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:54,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:54,266 INFO L82 PathProgramCache]: Analyzing trace with hash -382910472, now seen corresponding path program 1 times [2018-11-10 12:00:54,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:00:54,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:00:54,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:54,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:00:54,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:54,561 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2018-11-10 12:00:54,640 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:00:54,641 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:00:54,641 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:00:54,641 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:00:54,641 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:00:54,641 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:00:54,641 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:00:54,641 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:00:54,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 12:00:54,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:00:54,641 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:00:54,645 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 12:00:54,647 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 12:00:54,649 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 12:00:54,650 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 12:00:54,651 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 12:00:54,652 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 12:00:54,654 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 12:00:54,864 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2018-11-10 12:00:54,920 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 12:00:54,921 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 12:00:54,922 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 12:00:54,923 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 12:00:54,924 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 12:00:54,925 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 12:00:54,926 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 12:00:54,927 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 12:00:54,928 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 12:00:54,929 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 12:00:55,276 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:00:55,276 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:00:55,277 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 12:00:55,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:00:55,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:55,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:00:55,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:00:55,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,290 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 12:00:55,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:00:55,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:55,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:00:55,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:00:55,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,293 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 12:00:55,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:00:55,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:55,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:00:55,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:00:55,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,295 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 12:00:55,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:00:55,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:55,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:00:55,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:00:55,296 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,296 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 12:00:55,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:00:55,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:55,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:00:55,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:00:55,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,298 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 12:00:55,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:55,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:00:55,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:55,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,300 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 12:00:55,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,301 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:00:55,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,302 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:00:55,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:55,311 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,312 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 12:00:55,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:55,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:00:55,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:55,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,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 12:00:55,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:55,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:00:55,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:55,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,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 12:00:55,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:55,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:00:55,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:55,326 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,326 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 12:00:55,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:55,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:00:55,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:55,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,332 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 12:00:55,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:55,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:00:55,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:55,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,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 12:00:55,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,338 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:00:55,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,339 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:00:55,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:55,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,343 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 12:00:55,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:55,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:00:55,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:55,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,346 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 12:00:55,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:55,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:00:55,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:55,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,352 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 12:00:55,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,353 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:00:55,353 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-10 12:00:55,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,361 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2018-11-10 12:00:55,361 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-10 12:00:55,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:00:55,390 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 12:00:55,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:00:55,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:00:55,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:00:55,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:00:55,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:00:55,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:00:55,403 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:00:55,412 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:00:55,413 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 12:00:55,413 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:00:55,414 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:00:55,414 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:00:55,414 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~scanp~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_cstrpbrk_~scanp~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-11-10 12:00:55,453 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-10 12:00:55,454 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:00:55,455 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:00:55,455 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 12:00:55,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:55,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:00:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:55,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:00:55,533 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 12:00:55,533 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 12:00:55,534 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-10 12:00:55,600 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 63 states and 71 transitions. Complement of second has 9 states. [2018-11-10 12:00:55,601 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 12:00:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 12:00:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-10 12:00:55,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 13 letters. Loop has 5 letters. [2018-11-10 12:00:55,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:00:55,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 18 letters. Loop has 5 letters. [2018-11-10 12:00:55,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:00:55,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 13 letters. Loop has 10 letters. [2018-11-10 12:00:55,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:00:55,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 71 transitions. [2018-11-10 12:00:55,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 12:00:55,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 42 states and 48 transitions. [2018-11-10 12:00:55,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 12:00:55,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 12:00:55,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2018-11-10 12:00:55,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:00:55,605 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-10 12:00:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2018-11-10 12:00:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2018-11-10 12:00:55,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 12:00:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-10 12:00:55,608 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 12:00:55,608 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 12:00:55,608 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:00:55,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-11-10 12:00:55,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 12:00:55,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:00:55,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:00:55,610 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:00:55,610 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 12:00:55,610 INFO L793 eck$LassoCheckResult]: Stem: 485#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 481#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 469#L555 assume !(main_~length1~0 < 1); 470#L555-2 assume !(main_~length2~0 < 1); 463#L558-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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.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~malloc9.base, main_#t~malloc9.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~malloc9.base, main_#t~malloc9.offset; 464#L563 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L563 484#L563-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L563-1 479#L564 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 480#L546-6 assume true; 489#L545-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 493#L545-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L545-2 492#L545-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 486#L545-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 462#L546-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 467#L546-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L546-1 468#L546-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 476#L546-3 assume !(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 477#L546-6 assume true; 474#L545-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 475#L545-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L545-2 478#L545-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 483#L545-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 460#L546-5 [2018-11-10 12:00:55,610 INFO L795 eck$LassoCheckResult]: Loop: 460#L546-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 465#L546-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L546-1 466#L546-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 471#L546-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 459#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 460#L546-5 [2018-11-10 12:00:55,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:55,611 INFO L82 PathProgramCache]: Analyzing trace with hash 190697767, now seen corresponding path program 2 times [2018-11-10 12:00:55,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:00:55,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:00:55,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:55,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:00:55,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:55,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash 62061768, now seen corresponding path program 2 times [2018-11-10 12:00:55,631 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:00:55,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:00:55,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:55,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:00:55,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:00:55,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:55,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1881666402, now seen corresponding path program 1 times [2018-11-10 12:00:55,637 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:00:55,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:00:55,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:55,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:00:55,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:55,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:00:55,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:00:55,743 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4455bc6-6da6-47d9-ae67-2ea47daf9d90/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:00:55,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:00:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:55,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:00:55,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-10 12:00:55,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 12:00:55,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:00:55,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:00:55,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:00:55,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-11-10 12:00:59,810 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 12:01:02,902 WARN L179 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 12:01:16,019 WARN L179 SmtUtils]: Spent 12.01 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 12:01:16,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-10 12:01:16,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-11-10 12:01:16,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:16,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:16,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:16,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-11-10 12:01:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:16,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:01:16,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-11-10 12:01:16,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 12:01:16,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=327, Unknown=4, NotChecked=0, Total=380 [2018-11-10 12:01:16,087 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 20 states. [2018-11-10 12:01:19,791 WARN L179 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-11-10 12:01:23,503 WARN L179 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2018-11-10 12:01:36,191 WARN L179 SmtUtils]: Spent 12.67 s on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2018-11-10 12:01:48,950 WARN L179 SmtUtils]: Spent 12.75 s on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-11-10 12:01:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:01:49,015 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-11-10 12:01:49,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 12:01:49,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 82 transitions. [2018-11-10 12:01:49,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 12:01:49,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 59 states and 65 transitions. [2018-11-10 12:01:49,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 12:01:49,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 12:01:49,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 65 transitions. [2018-11-10 12:01:49,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:01:49,017 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-11-10 12:01:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 65 transitions. [2018-11-10 12:01:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2018-11-10 12:01:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 12:01:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-10 12:01:49,020 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-10 12:01:49,020 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-10 12:01:49,020 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:01:49,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 47 transitions. [2018-11-10 12:01:49,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 12:01:49,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:01:49,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:01:49,021 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:49,021 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 12:01:49,021 INFO L793 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 722#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 712#L555 assume !(main_~length1~0 < 1); 713#L555-2 assume !(main_~length2~0 < 1); 706#L558-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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.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~malloc9.base, main_#t~malloc9.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~malloc9.base, main_#t~malloc9.offset; 707#L563 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L563 727#L563-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L563-1 723#L564 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 724#L546-6 assume true; 731#L545-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 720#L545-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L545-2 721#L545-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 725#L545-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 743#L546-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 742#L546-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L546-1 717#L546-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 718#L546-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 741#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 740#L546-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 739#L546-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L546-1 738#L546-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 733#L546-3 assume !(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 732#L546-6 assume true; 714#L545-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 715#L545-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L545-2 734#L545-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 728#L545-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 703#L546-5 [2018-11-10 12:01:49,021 INFO L795 eck$LassoCheckResult]: Loop: 703#L546-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 708#L546-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L546-1 709#L546-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 716#L546-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 702#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 703#L546-5 [2018-11-10 12:01:49,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:49,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1623299104, now seen corresponding path program 2 times [2018-11-10 12:01:49,022 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:49,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:49,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:49,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:49,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:49,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:49,042 INFO L82 PathProgramCache]: Analyzing trace with hash 62061768, now seen corresponding path program 3 times [2018-11-10 12:01:49,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:49,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:49,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:49,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:01:49,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:49,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:49,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1313350729, now seen corresponding path program 3 times [2018-11-10 12:01:49,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:49,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:49,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:01:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:49,553 WARN L179 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 170 [2018-11-10 12:01:49,673 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-10 12:01:49,675 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:01:49,675 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:01:49,675 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:01:49,675 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:01:49,675 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:01:49,675 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:01:49,675 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:01:49,675 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:01:49,675 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-10 12:01:49,675 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:01:49,675 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:01:49,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 12:01:49,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 12:01:49,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 12:01:49,682 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 12:01:49,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 12:01:49,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 12:01:49,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 12:01:49,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 12:01:49,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 12:01:49,688 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 12:01:49,690 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 12:01:49,696 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 12:01:49,698 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 12:01:49,699 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 12:01:49,701 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 12:01:49,702 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 12:01:49,703 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 12:01:49,704 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 12:01:50,069 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2018-11-10 12:01:50,779 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-10 12:01:50,799 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:01:50,799 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:01:50,799 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 12:01:50,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:50,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:50,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:50,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,801 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 12:01:50,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:50,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:50,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:50,802 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,802 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 12:01:50,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:50,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:50,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:50,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,803 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 12:01:50,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:50,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:50,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,806 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 12:01:50,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:50,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:50,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:50,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,807 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 12:01:50,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:50,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:50,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:50,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,809 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 12:01:50,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:50,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:50,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:50,810 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,810 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 12:01:50,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:50,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:50,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:50,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,812 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 12:01:50,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:50,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:50,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:50,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,814 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 12:01:50,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:50,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:50,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:50,814 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,815 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 12:01:50,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:50,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:50,816 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,817 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 12:01:50,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:50,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:50,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,819 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 12:01:50,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:50,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:50,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,821 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 12:01:50,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:50,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:50,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:50,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,823 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 12:01:50,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:50,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:50,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:50,824 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,824 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 12:01:50,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:50,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:50,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:50,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,826 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 12:01:50,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:50,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:50,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:50,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:50,828 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 12:01:50,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:50,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:50,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:50,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:50,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:50,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:50,852 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:01:50,873 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 12:01:50,873 INFO L444 ModelExtractionUtils]: 51 out of 58 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 12:01:50,873 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:01:50,874 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:01:50,874 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:01:50,875 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_3 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-11-10 12:01:50,978 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2018-11-10 12:01:50,979 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:01:50,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:50,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:51,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:51,017 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 12:01:51,017 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 12:01:51,017 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 12:01:51,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 60 states and 67 transitions. Complement of second has 7 states. [2018-11-10 12:01:51,040 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 12:01:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:01:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-10 12:01:51,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 27 letters. Loop has 5 letters. [2018-11-10 12:01:51,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:51,041 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:01:51,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:51,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:51,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:51,086 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 12:01:51,086 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 12:01:51,086 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 12:01:51,119 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 61 states and 68 transitions. Complement of second has 9 states. [2018-11-10 12:01:51,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 12:01:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:01:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-10 12:01:51,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 27 letters. Loop has 5 letters. [2018-11-10 12:01:51,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:51,120 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:01:51,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:51,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:51,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:51,167 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 12:01:51,167 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 3 loop predicates [2018-11-10 12:01:51,167 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 12:01:51,187 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 66 states and 74 transitions. Complement of second has 6 states. [2018-11-10 12:01:51,188 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 12:01:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:01:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-10 12:01:51,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 27 letters. Loop has 5 letters. [2018-11-10 12:01:51,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:51,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-10 12:01:51,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:51,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-10 12:01:51,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:51,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2018-11-10 12:01:51,194 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:01:51,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-11-10 12:01:51,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:01:51,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:01:51,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:01:51,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:01:51,195 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:01:51,195 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:01:51,195 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:01:51,195 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:01:51,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:01:51,195 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:01:51,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:01:51,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:01:51 BoogieIcfgContainer [2018-11-10 12:01:51,200 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:01:51,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:01:51,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:01:51,200 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:01:51,200 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:00:52" (3/4) ... [2018-11-10 12:01:51,203 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:01:51,203 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:01:51,204 INFO L168 Benchmark]: Toolchain (without parser) took 59530.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 383.8 MB). Free memory was 957.5 MB in the beginning and 1.4 GB in the end (delta: -406.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:01:51,204 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:01:51,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.67 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:01:51,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -211.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:01:51,205 INFO L168 Benchmark]: Boogie Preprocessor took 20.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:01:51,205 INFO L168 Benchmark]: RCFGBuilder took 183.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:01:51,206 INFO L168 Benchmark]: BuchiAutomizer took 58936.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -239.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:01:51,206 INFO L168 Benchmark]: Witness Printer took 3.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:01:51,208 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.67 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -211.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 183.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 58936.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -239.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s1 and consists of 5 locations. One deterministic module has affine ranking function -1 * scanp + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[scanp] + -1 * scanp and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 58.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 25.2s. Construction of modules took 0.1s. Büchi inclusion checks took 33.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 155 SDtfs, 182 SDslu, 307 SDs, 0 SdLazy, 325 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax100 hnf99 lsp96 ukn98 mio100 lsp40 div100 bol100 ite100 ukn100 eq188 hnf87 smp91 dnf236 smp90 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 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...