./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0d59f4b7-6448-46d2-a3de-cdc66d3fc2e0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0d59f4b7-6448-46d2-a3de-cdc66d3fc2e0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0d59f4b7-6448-46d2-a3de-cdc66d3fc2e0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0d59f4b7-6448-46d2-a3de-cdc66d3fc2e0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0d59f4b7-6448-46d2-a3de-cdc66d3fc2e0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0d59f4b7-6448-46d2-a3de-cdc66d3fc2e0/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 1f6e8c8b965f85c3429105401e9fda59f9f060cb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:57:31,519 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:57:31,520 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:57:31,529 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:57:31,530 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:57:31,530 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:57:31,531 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:57:31,532 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:57:31,533 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:57:31,533 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:57:31,534 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:57:31,534 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:57:31,535 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:57:31,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:57:31,536 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:57:31,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:57:31,538 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:57:31,539 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:57:31,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:57:31,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:57:31,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:57:31,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:57:31,545 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:57:31,545 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:57:31,545 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:57:31,546 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:57:31,546 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:57:31,547 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:57:31,548 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:57:31,548 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:57:31,549 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:57:31,549 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:57:31,549 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:57:31,549 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:57:31,550 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:57:31,551 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:57:31,551 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0d59f4b7-6448-46d2-a3de-cdc66d3fc2e0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 11:57:31,562 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:57:31,562 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:57:31,563 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:57:31,563 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:57:31,563 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:57:31,564 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 11:57:31,564 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 11:57:31,564 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 11:57:31,564 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 11:57:31,564 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 11:57:31,564 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 11:57:31,564 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:57:31,564 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:57:31,565 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 11:57:31,565 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:57:31,565 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:57:31,565 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:57:31,565 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 11:57:31,565 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 11:57:31,565 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 11:57:31,566 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:57:31,566 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:57:31,566 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 11:57:31,566 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:57:31,566 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 11:57:31,566 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:57:31,566 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:57:31,566 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 11:57:31,567 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:57:31,567 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:57:31,567 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 11:57:31,568 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 11:57:31,568 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_0d59f4b7-6448-46d2-a3de-cdc66d3fc2e0/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 -> 1f6e8c8b965f85c3429105401e9fda59f9f060cb [2018-11-18 11:57:31,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:57:31,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:57:31,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:57:31,604 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:57:31,605 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:57:31,605 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0d59f4b7-6448-46d2-a3de-cdc66d3fc2e0/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-18 11:57:31,646 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0d59f4b7-6448-46d2-a3de-cdc66d3fc2e0/bin-2019/uautomizer/data/916376f2f/681508c14d324b7995945c40af12a481/FLAG257e9e975 [2018-11-18 11:57:32,009 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:57:32,009 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0d59f4b7-6448-46d2-a3de-cdc66d3fc2e0/sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-18 11:57:32,017 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0d59f4b7-6448-46d2-a3de-cdc66d3fc2e0/bin-2019/uautomizer/data/916376f2f/681508c14d324b7995945c40af12a481/FLAG257e9e975 [2018-11-18 11:57:32,411 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0d59f4b7-6448-46d2-a3de-cdc66d3fc2e0/bin-2019/uautomizer/data/916376f2f/681508c14d324b7995945c40af12a481 [2018-11-18 11:57:32,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:57:32,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:57:32,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:57:32,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:57:32,417 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:57:32,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:57:32" (1/1) ... [2018-11-18 11:57:32,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a782c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:32, skipping insertion in model container [2018-11-18 11:57:32,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:57:32" (1/1) ... [2018-11-18 11:57:32,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:57:32,451 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:57:32,634 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:57:32,640 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:57:32,669 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:57:32,739 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:57:32,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:32 WrapperNode [2018-11-18 11:57:32,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:57:32,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:57:32,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:57:32,740 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:57:32,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:32" (1/1) ... [2018-11-18 11:57:32,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:32" (1/1) ... [2018-11-18 11:57:32,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:57:32,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:57:32,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:57:32,767 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:57:32,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:32" (1/1) ... [2018-11-18 11:57:32,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:32" (1/1) ... [2018-11-18 11:57:32,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:32" (1/1) ... [2018-11-18 11:57:32,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:32" (1/1) ... [2018-11-18 11:57:32,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:32" (1/1) ... [2018-11-18 11:57:32,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:32" (1/1) ... [2018-11-18 11:57:32,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:32" (1/1) ... [2018-11-18 11:57:32,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:57:32,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:57:32,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:57:32,787 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:57:32,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d59f4b7-6448-46d2-a3de-cdc66d3fc2e0/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-18 11:57:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 11:57:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 11:57:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 11:57:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 11:57:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:57:32,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:57:32,997 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:57:32,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:57:32 BoogieIcfgContainer [2018-11-18 11:57:32,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:57:32,998 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 11:57:32,998 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 11:57:33,000 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 11:57:33,001 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:57:33,001 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 11:57:32" (1/3) ... [2018-11-18 11:57:33,001 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@563fb6ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:57:33, skipping insertion in model container [2018-11-18 11:57:33,002 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:57:33,002 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:32" (2/3) ... [2018-11-18 11:57:33,002 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@563fb6ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:57:33, skipping insertion in model container [2018-11-18 11:57:33,002 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:57:33,002 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:57:32" (3/3) ... [2018-11-18 11:57:33,003 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-18 11:57:33,036 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:57:33,037 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 11:57:33,037 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 11:57:33,037 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 11:57:33,037 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:57:33,037 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:57:33,037 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 11:57:33,037 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:57:33,037 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 11:57:33,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 11:57:33,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 11:57:33,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:57:33,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:57:33,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 11:57:33,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:57:33,072 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 11:57:33,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 11:57:33,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 11:57:33,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:57:33,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:57:33,074 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 11:57:33,074 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:57:33,079 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 3#L558true assume !(main_~length1~0 < 1); 7#L558-2true assume !(main_~length2~0 < 1); 20#L561-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 15#L545-4true [2018-11-18 11:57:33,079 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-4true assume true;call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 8#L545-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 12#L548-6true assume !true; 16#L548-7true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 19#L550true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 13#L545-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 15#L545-4true [2018-11-18 11:57:33,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:33,086 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-18 11:57:33,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:57:33,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:57:33,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:33,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:57:33,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:33,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:33,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1454947914, now seen corresponding path program 1 times [2018-11-18 11:57:33,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:57:33,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:57:33,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:33,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:57:33,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:57:33,211 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-18 11:57:33,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:57:33,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:57:33,216 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:57:33,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 11:57:33,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:57:33,227 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 11:57:33,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:57:33,233 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-11-18 11:57:33,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:57:33,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-11-18 11:57:33,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 11:57:33,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 18 transitions. [2018-11-18 11:57:33,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 11:57:33,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 11:57:33,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2018-11-18 11:57:33,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:57:33,241 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 11:57:33,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2018-11-18 11:57:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 11:57:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 11:57:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-18 11:57:33,262 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 11:57:33,262 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 11:57:33,262 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 11:57:33,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-18 11:57:33,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 11:57:33,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:57:33,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:57:33,263 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 11:57:33,263 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:57:33,264 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 55#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 46#L558 assume !(main_~length1~0 < 1); 47#L558-2 assume !(main_~length2~0 < 1); 51#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 57#L545-4 [2018-11-18 11:57:33,264 INFO L796 eck$LassoCheckResult]: Loop: 57#L545-4 assume true;call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 52#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 53#L548-6 assume true; 48#L548-1 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 49#L548-2 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 50#L548-4 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 54#L548-7 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 59#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 56#L545-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 57#L545-4 [2018-11-18 11:57:33,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:33,264 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-18 11:57:33,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:57:33,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:57:33,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:33,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:57:33,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:33,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1329778143, now seen corresponding path program 1 times [2018-11-18 11:57:33,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:57:33,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:57:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:33,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:57:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:33,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:33,313 INFO L82 PathProgramCache]: Analyzing trace with hash 152793724, now seen corresponding path program 1 times [2018-11-18 11:57:33,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:57:33,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:57:33,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:33,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:57:33,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:33,516 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-18 11:57:33,667 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-18 11:57:33,804 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-18 11:57:33,882 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:57:33,883 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:57:33,883 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:57:33,883 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:57:33,884 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:57:33,884 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:57:33,884 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:57:33,884 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:57:33,884 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-18 11:57:33,884 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:57:33,885 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:57:33,904 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-18 11:57:33,909 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-18 11:57:34,173 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-18 11:57:34,175 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-18 11:57:34,176 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-18 11:57:34,178 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-18 11:57:34,179 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-18 11:57:34,180 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-18 11:57:34,182 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-18 11:57:34,183 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-18 11:57:34,185 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-18 11:57:34,186 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-18 11:57:34,187 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-18 11:57:34,188 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-18 11:57:34,189 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-18 11:57:34,190 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-18 11:57:34,191 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-18 11:57:34,193 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-18 11:57:34,571 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:57:34,576 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:57:34,577 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-18 11:57:34,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:34,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:34,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:34,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:34,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:34,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:34,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:34,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:34,584 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-18 11:57:34,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:34,584 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:57:34,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:34,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:34,588 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:57:34,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:34,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:34,605 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-18 11:57:34,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:34,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:34,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:34,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:34,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:34,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:34,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:34,612 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-18 11:57:34,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:34,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:34,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:34,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:34,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:34,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:34,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:34,619 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-18 11:57:34,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:34,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:34,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:34,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:34,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:34,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:34,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:34,632 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-18 11:57:34,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:34,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:34,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:34,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:34,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:34,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:34,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:34,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:34,635 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-18 11:57:34,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:34,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:34,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:34,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:34,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:34,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:34,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:34,640 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-18 11:57:34,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:34,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:34,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:34,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:34,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:34,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:34,662 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:57:34,677 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 11:57:34,677 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 11:57:34,679 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:57:34,680 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:57:34,680 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:57:34,681 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2018-11-18 11:57:34,726 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 11:57:34,732 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:57:34,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:57:34,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:57:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:57:34,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:57:34,788 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-18 11:57:34,790 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 11:57:34,791 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 11:57:34,837 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 4 states. [2018-11-18 11:57:34,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 11:57:34,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 11:57:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-18 11:57:34,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 9 letters. [2018-11-18 11:57:34,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:57:34,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 9 letters. [2018-11-18 11:57:34,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:57:34,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-18 11:57:34,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:57:34,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-18 11:57:34,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:57:34,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 27 transitions. [2018-11-18 11:57:34,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 11:57:34,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 11:57:34,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-11-18 11:57:34,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:57:34,846 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 11:57:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-11-18 11:57:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 11:57:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 11:57:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-11-18 11:57:34,848 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 11:57:34,848 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 11:57:34,848 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 11:57:34,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2018-11-18 11:57:34,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:57:34,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:57:34,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:57:34,849 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:57:34,849 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:57:34,849 INFO L794 eck$LassoCheckResult]: Stem: 203#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 200#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 186#L558 assume !(main_~length1~0 < 1); 187#L558-2 assume !(main_~length2~0 < 1); 194#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 204#L545-4 assume true;call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 195#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 196#L548-6 [2018-11-18 11:57:34,849 INFO L796 eck$LassoCheckResult]: Loop: 196#L548-6 assume true; 188#L548-1 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 189#L548-2 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 192#L548-4 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 196#L548-6 [2018-11-18 11:57:34,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:34,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-18 11:57:34,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:57:34,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:57:34,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:34,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:57:34,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:34,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:34,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 1 times [2018-11-18 11:57:34,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:57:34,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:57:34,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:34,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:57:34,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:34,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:34,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2145109973, now seen corresponding path program 1 times [2018-11-18 11:57:34,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:57:34,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:57:34,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:34,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:57:34,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:35,186 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-11-18 11:57:35,249 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:57:35,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:57:35,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:57:35,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:57:35,249 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:57:35,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:57:35,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:57:35,249 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:57:35,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-18 11:57:35,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:57:35,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:57:35,252 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-18 11:57:35,253 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-18 11:57:35,255 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-18 11:57:35,255 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-18 11:57:35,257 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-18 11:57:35,258 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-18 11:57:35,259 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-18 11:57:35,259 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-18 11:57:35,261 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-18 11:57:35,262 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-18 11:57:35,262 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-18 11:57:35,263 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-18 11:57:35,264 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-18 11:57:35,265 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-18 11:57:35,266 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-18 11:57:35,267 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-18 11:57:35,268 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-18 11:57:35,270 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-18 11:57:35,823 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:57:35,823 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:57:35,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-18 11:57:35,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,827 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-18 11:57:35,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,830 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-18 11:57:35,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,832 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-18 11:57:35,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:35,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:35,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,846 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-18 11:57:35,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,848 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-18 11:57:35,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,850 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-18 11:57:35,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,852 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-18 11:57:35,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:35,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:35,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,855 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-18 11:57:35,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,857 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-18 11:57:35,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,859 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-18 11:57:35,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,860 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-18 11:57:35,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,862 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-18 11:57:35,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,864 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-18 11:57:35,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,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-18 11:57:35,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,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-18 11:57:35,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,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-18 11:57:35,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:35,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:35,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:35,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,871 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-18 11:57:35,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,871 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:57:35,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,873 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:57:35,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:35,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,881 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-18 11:57:35,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:35,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:35,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,884 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-18 11:57:35,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,884 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:57:35,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,885 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:57:35,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:35,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,891 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-18 11:57:35,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:35,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:35,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,894 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-18 11:57:35,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:35,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:35,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,900 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-18 11:57:35,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:35,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:35,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:35,904 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-18 11:57:35,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:35,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:35,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:35,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:35,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:35,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:35,924 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:57:35,935 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 11:57:35,935 INFO L444 ModelExtractionUtils]: 37 out of 43 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 11:57:35,936 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:57:35,936 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:57:35,937 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:57:35,937 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-18 11:57:35,989 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-18 11:57:35,991 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:57:36,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:57:36,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:57:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:57:36,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:57:36,056 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-18 11:57:36,056 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 11:57:36,056 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-18 11:57:36,097 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 49 states and 63 transitions. Complement of second has 8 states. [2018-11-18 11:57:36,097 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-18 11:57:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:57:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 11:57:36,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 11:57:36,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:57:36,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-18 11:57:36,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:57:36,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-18 11:57:36,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:57:36,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2018-11-18 11:57:36,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:57:36,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 34 states and 44 transitions. [2018-11-18 11:57:36,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 11:57:36,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 11:57:36,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2018-11-18 11:57:36,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:57:36,101 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-18 11:57:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2018-11-18 11:57:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-18 11:57:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 11:57:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-18 11:57:36,103 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 11:57:36,103 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 11:57:36,103 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 11:57:36,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2018-11-18 11:57:36,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:57:36,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:57:36,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:57:36,104 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:57:36,104 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:57:36,104 INFO L794 eck$LassoCheckResult]: Stem: 390#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 372#L558 assume !(main_~length1~0 < 1); 373#L558-2 assume !(main_~length2~0 < 1); 380#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 393#L545-4 assume true;call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 394#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 382#L548-6 assume true; 397#L548-1 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 396#L548-2 assume !cstrspn_#t~short7; 395#L548-4 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 391#L548-7 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 392#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 388#L545-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 389#L545-4 assume true;call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 383#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 381#L548-6 [2018-11-18 11:57:36,104 INFO L796 eck$LassoCheckResult]: Loop: 381#L548-6 assume true; 374#L548-1 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 375#L548-2 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 378#L548-4 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 381#L548-6 [2018-11-18 11:57:36,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:36,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1714078621, now seen corresponding path program 1 times [2018-11-18 11:57:36,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:57:36,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:57:36,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:36,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:57:36,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:57:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:57:36,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:57:36,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 11:57:36,145 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:57:36,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:36,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 2 times [2018-11-18 11:57:36,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:57:36,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:57:36,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:36,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:57:36,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:36,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:57:36,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:57:36,251 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-18 11:57:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:57:36,305 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2018-11-18 11:57:36,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:57:36,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2018-11-18 11:57:36,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 11:57:36,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 39 transitions. [2018-11-18 11:57:36,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 11:57:36,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 11:57:36,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2018-11-18 11:57:36,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:57:36,313 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 11:57:36,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2018-11-18 11:57:36,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-18 11:57:36,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 11:57:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-18 11:57:36,315 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-18 11:57:36,315 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-18 11:57:36,315 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 11:57:36,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2018-11-18 11:57:36,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:57:36,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:57:36,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:57:36,316 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:57:36,316 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:57:36,316 INFO L794 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 465#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 452#L558 assume !(main_~length1~0 < 1); 453#L558-2 assume !(main_~length2~0 < 1); 460#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 471#L545-4 assume true;call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 464#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 462#L548-6 assume true; 477#L548-1 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 476#L548-2 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 475#L548-4 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 473#L548-7 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 474#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 468#L545-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 469#L545-4 assume true;call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 463#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 461#L548-6 [2018-11-18 11:57:36,316 INFO L796 eck$LassoCheckResult]: Loop: 461#L548-6 assume true; 454#L548-1 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 455#L548-2 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 458#L548-4 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 461#L548-6 [2018-11-18 11:57:36,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:36,317 INFO L82 PathProgramCache]: Analyzing trace with hash 805881313, now seen corresponding path program 2 times [2018-11-18 11:57:36,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:57:36,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:57:36,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:36,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:57:36,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:36,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 3 times [2018-11-18 11:57:36,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:57:36,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:57:36,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:36,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:57:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:36,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:36,342 INFO L82 PathProgramCache]: Analyzing trace with hash -795992949, now seen corresponding path program 1 times [2018-11-18 11:57:36,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:57:36,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:57:36,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:36,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:57:36,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:57:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:57:36,801 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 133 [2018-11-18 11:57:37,364 WARN L180 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2018-11-18 11:57:37,366 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:57:37,366 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:57:37,366 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:57:37,366 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:57:37,366 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:57:37,366 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:57:37,366 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:57:37,366 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:57:37,366 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-18 11:57:37,366 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:57:37,366 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:57:37,371 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-18 11:57:37,374 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-18 11:57:37,377 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-18 11:57:37,378 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-18 11:57:37,380 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-18 11:57:37,381 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-18 11:57:37,382 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-18 11:57:37,384 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-18 11:57:37,385 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-18 11:57:37,386 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-18 11:57:37,387 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-18 11:57:37,387 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-18 11:57:37,388 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-18 11:57:37,520 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 11:57:37,948 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-18 11:57:38,030 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-18 11:57:38,031 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-18 11:57:38,032 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-18 11:57:38,033 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-18 11:57:38,034 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-18 11:57:38,035 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-18 11:57:38,449 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-11-18 11:57:38,641 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:57:38,641 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:57:38,642 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-18 11:57:38,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:38,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:38,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:38,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:38,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,643 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-18 11:57:38,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:38,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:38,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:38,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,646 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-18 11:57:38,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:38,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:38,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:38,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:38,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,648 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-18 11:57:38,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:38,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:38,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:38,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:38,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,649 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-18 11:57:38,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:38,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:38,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:38,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:38,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,651 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-18 11:57:38,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:38,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:38,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:38,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:38,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,652 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-18 11:57:38,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:38,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:38,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:38,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,655 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-18 11:57:38,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:38,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:38,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:38,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,658 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-18 11:57:38,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:38,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:38,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:38,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:38,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:57:38,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:38,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:38,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:38,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:38,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:57:38,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:38,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:38,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:38,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:38,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:57:38,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:57:38,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:38,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:57:38,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:57:38,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:57:38,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,664 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:57:38,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,666 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:57:38,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:38,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,672 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-18 11:57:38,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,672 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-18 11:57:38,672 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-18 11:57:38,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,699 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-18 11:57:38,699 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-18 11:57:38,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,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-18 11:57:38,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,811 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:57:38,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,812 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:57:38,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:38,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:57:38,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-18 11:57:38,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:57:38,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:57:38,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:57:38,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:57:38,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:57:38,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:57:38,834 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:57:38,850 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 11:57:38,851 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 11:57:38,851 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:57:38,852 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:57:38,852 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:57:38,852 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-18 11:57:39,041 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-11-18 11:57:39,043 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:57:39,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:57:39,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:57:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:57:39,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:57:39,103 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-18 11:57:39,103 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 11:57:39,103 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 11:57:39,137 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 47 states and 57 transitions. Complement of second has 8 states. [2018-11-18 11:57:39,140 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-18 11:57:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:57:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 11:57:39,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 11:57:39,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:57:39,141 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:57:39,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:57:39,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:57:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:57:39,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:57:39,191 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-18 11:57:39,191 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 11:57:39,192 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 11:57:39,216 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 47 states and 57 transitions. Complement of second has 8 states. [2018-11-18 11:57:39,217 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-18 11:57:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:57:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 11:57:39,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 11:57:39,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:57:39,218 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:57:39,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:57:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:57:39,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:57:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:57:39,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:57:39,272 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-18 11:57:39,273 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 11:57:39,273 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 11:57:39,299 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 49 states and 61 transitions. Complement of second has 7 states. [2018-11-18 11:57:39,300 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-18 11:57:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:57:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-18 11:57:39,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 11:57:39,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:57:39,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-18 11:57:39,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:57:39,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-18 11:57:39,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:57:39,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 61 transitions. [2018-11-18 11:57:39,303 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:57:39,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2018-11-18 11:57:39,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 11:57:39,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 11:57:39,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 11:57:39,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:57:39,303 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:57:39,303 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:57:39,303 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:57:39,303 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 11:57:39,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:57:39,304 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:57:39,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 11:57:39,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:57:39 BoogieIcfgContainer [2018-11-18 11:57:39,309 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:57:39,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:57:39,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:57:39,309 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:57:39,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:57:32" (3/4) ... [2018-11-18 11:57:39,313 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 11:57:39,313 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:57:39,313 INFO L168 Benchmark]: Toolchain (without parser) took 6899.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 395.3 MB). Free memory was 956.4 MB in the beginning and 1.3 GB in the end (delta: -352.4 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:57:39,314 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:57:39,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -208.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-11-18 11:57:39,315 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:57:39,315 INFO L168 Benchmark]: Boogie Preprocessor took 19.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:57:39,316 INFO L168 Benchmark]: RCFGBuilder took 210.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:57:39,318 INFO L168 Benchmark]: BuchiAutomizer took 6310.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -170.7 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:57:39,318 INFO L168 Benchmark]: Witness Printer took 3.60 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:57:39,321 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -208.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 210.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6310.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -170.7 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.60 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 113 SDtfs, 129 SDslu, 83 SDs, 0 SdLazy, 103 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax100 hnf99 lsp91 ukn70 mio100 lsp31 div136 bol100 ite100 ukn100 eq161 hnf77 smp95 dnf675 smp24 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 138ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...