./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_afd50236-f5b3-4bff-9225-9daec73ae423/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_afd50236-f5b3-4bff-9225-9daec73ae423/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_afd50236-f5b3-4bff-9225-9daec73ae423/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_afd50236-f5b3-4bff-9225-9daec73ae423/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_afd50236-f5b3-4bff-9225-9daec73ae423/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_afd50236-f5b3-4bff-9225-9daec73ae423/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 022e5e55adeb2213dd3e7a54e30f105429bff667 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 00:41:16,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 00:41:16,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 00:41:16,696 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 00:41:16,696 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 00:41:16,697 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 00:41:16,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 00:41:16,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 00:41:16,699 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 00:41:16,700 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 00:41:16,700 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 00:41:16,700 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 00:41:16,701 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 00:41:16,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 00:41:16,702 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 00:41:16,702 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 00:41:16,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 00:41:16,704 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 00:41:16,705 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 00:41:16,706 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 00:41:16,706 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 00:41:16,707 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 00:41:16,708 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 00:41:16,708 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 00:41:16,708 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 00:41:16,708 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 00:41:16,709 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 00:41:16,709 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 00:41:16,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 00:41:16,710 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 00:41:16,710 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 00:41:16,711 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 00:41:16,711 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 00:41:16,711 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 00:41:16,711 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 00:41:16,712 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 00:41:16,712 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_afd50236-f5b3-4bff-9225-9daec73ae423/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-03 00:41:16,720 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 00:41:16,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 00:41:16,721 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 00:41:16,721 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 00:41:16,721 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 00:41:16,721 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-03 00:41:16,721 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-03 00:41:16,721 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-03 00:41:16,721 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-03 00:41:16,722 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-03 00:41:16,722 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-03 00:41:16,722 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 00:41:16,722 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 00:41:16,722 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 00:41:16,722 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 00:41:16,722 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 00:41:16,722 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 00:41:16,722 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-03 00:41:16,722 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-03 00:41:16,722 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-03 00:41:16,722 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 00:41:16,723 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 00:41:16,723 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-03 00:41:16,723 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 00:41:16,723 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-03 00:41:16,723 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 00:41:16,723 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 00:41:16,723 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-03 00:41:16,723 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 00:41:16,723 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-03 00:41:16,723 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-03 00:41:16,724 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-03 00:41:16,724 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_afd50236-f5b3-4bff-9225-9daec73ae423/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 -> 022e5e55adeb2213dd3e7a54e30f105429bff667 [2018-12-03 00:41:16,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 00:41:16,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 00:41:16,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 00:41:16,751 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 00:41:16,751 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 00:41:16,751 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_afd50236-f5b3-4bff-9225-9daec73ae423/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-03 00:41:16,784 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_afd50236-f5b3-4bff-9225-9daec73ae423/bin-2019/uautomizer/data/bf12b2a53/a7b8e7ca4f244e8986ca5ddf0f744b0e/FLAGedbb786f3 [2018-12-03 00:41:17,227 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 00:41:17,228 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_afd50236-f5b3-4bff-9225-9daec73ae423/sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-03 00:41:17,233 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_afd50236-f5b3-4bff-9225-9daec73ae423/bin-2019/uautomizer/data/bf12b2a53/a7b8e7ca4f244e8986ca5ddf0f744b0e/FLAGedbb786f3 [2018-12-03 00:41:17,241 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_afd50236-f5b3-4bff-9225-9daec73ae423/bin-2019/uautomizer/data/bf12b2a53/a7b8e7ca4f244e8986ca5ddf0f744b0e [2018-12-03 00:41:17,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 00:41:17,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 00:41:17,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 00:41:17,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 00:41:17,246 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 00:41:17,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:41:17" (1/1) ... [2018-12-03 00:41:17,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4834854b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:41:17, skipping insertion in model container [2018-12-03 00:41:17,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:41:17" (1/1) ... [2018-12-03 00:41:17,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 00:41:17,274 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 00:41:17,424 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:41:17,430 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 00:41:17,505 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:41:17,528 INFO L195 MainTranslator]: Completed translation [2018-12-03 00:41:17,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:41:17 WrapperNode [2018-12-03 00:41:17,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 00:41:17,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 00:41:17,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 00:41:17,529 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 00:41:17,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:41:17" (1/1) ... [2018-12-03 00:41:17,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:41:17" (1/1) ... [2018-12-03 00:41:17,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 00:41:17,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 00:41:17,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 00:41:17,565 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 00:41:17,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:41:17" (1/1) ... [2018-12-03 00:41:17,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:41:17" (1/1) ... [2018-12-03 00:41:17,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:41:17" (1/1) ... [2018-12-03 00:41:17,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:41:17" (1/1) ... [2018-12-03 00:41:17,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:41:17" (1/1) ... [2018-12-03 00:41:17,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:41:17" (1/1) ... [2018-12-03 00:41:17,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:41:17" (1/1) ... [2018-12-03 00:41:17,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 00:41:17,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 00:41:17,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 00:41:17,585 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 00:41:17,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:41:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afd50236-f5b3-4bff-9225-9daec73ae423/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-12-03 00:41:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 00:41:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 00:41:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 00:41:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 00:41:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 00:41:17,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 00:41:17,772 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 00:41:17,772 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 00:41:17,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:41:17 BoogieIcfgContainer [2018-12-03 00:41:17,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 00:41:17,773 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-03 00:41:17,773 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-03 00:41:17,775 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-03 00:41:17,776 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-03 00:41:17,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 03.12 12:41:17" (1/3) ... [2018-12-03 00:41:17,777 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@101c6b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 03.12 12:41:17, skipping insertion in model container [2018-12-03 00:41:17,777 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-03 00:41:17,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:41:17" (2/3) ... [2018-12-03 00:41:17,777 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@101c6b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 03.12 12:41:17, skipping insertion in model container [2018-12-03 00:41:17,777 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-03 00:41:17,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:41:17" (3/3) ... [2018-12-03 00:41:17,778 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-03 00:41:17,811 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 00:41:17,812 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-03 00:41:17,812 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-03 00:41:17,812 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-03 00:41:17,812 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 00:41:17,812 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 00:41:17,812 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-03 00:41:17,812 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 00:41:17,812 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-03 00:41:17,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-03 00:41:17,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-03 00:41:17,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 00:41:17,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 00:41:17,843 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-03 00:41:17,843 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-03 00:41:17,843 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-03 00:41:17,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-03 00:41:17,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-03 00:41:17,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 00:41:17,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 00:41:17,845 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-03 00:41:17,846 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-03 00:41:17,851 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true 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); 6#L558-2true assume !(main_~length2~0 < 1); 19#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);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 15#L545-4true [2018-12-03 00:41:17,851 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-4true call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 8#L545-1true assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 9#L548-5true assume !true; 12#L548-6true call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 18#L550true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 13#L545-3true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 15#L545-4true [2018-12-03 00:41:17,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:41:17,855 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-03 00:41:17,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:41:17,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:41:17,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:17,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:41:17,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:17,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:41:17,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-12-03 00:41:17,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:41:17,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:41:17,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:17,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:41:17,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:41:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:41:17,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:41:17,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 00:41:17,981 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-03 00:41:17,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-03 00:41:17,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-03 00:41:17,991 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-03 00:41:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:41:17,995 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-03 00:41:17,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-03 00:41:17,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-03 00:41:17,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-03 00:41:17,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-12-03 00:41:18,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-03 00:41:18,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-03 00:41:18,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-03 00:41:18,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 00:41:18,001 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-03 00:41:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-03 00:41:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 00:41:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 00:41:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-03 00:41:18,017 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-03 00:41:18,017 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-03 00:41:18,018 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-03 00:41:18,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-03 00:41:18,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-03 00:41:18,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 00:41:18,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 00:41:18,018 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-03 00:41:18,018 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:41:18,019 INFO L794 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 52#L-1 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; 44#L558 assume !(main_~length1~0 < 1); 45#L558-2 assume !(main_~length2~0 < 1); 48#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);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 55#L545-4 [2018-12-03 00:41:18,019 INFO L796 eck$LassoCheckResult]: Loop: 55#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 51#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 50#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 46#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 47#L548-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6; 49#L548-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 53#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 54#L545-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 55#L545-4 [2018-12-03 00:41:18,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:41:18,019 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-03 00:41:18,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:41:18,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:41:18,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:18,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:41:18,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:18,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:41:18,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-12-03 00:41:18,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:41:18,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:41:18,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:18,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 00:41:18,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:18,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:41:18,054 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-12-03 00:41:18,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:41:18,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:41:18,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:18,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:41:18,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:18,195 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-12-03 00:41:18,327 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-12-03 00:41:18,461 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-12-03 00:41:18,528 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 00:41:18,529 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 00:41:18,529 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 00:41:18,529 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 00:41:18,529 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-03 00:41:18,529 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 00:41:18,529 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 00:41:18,530 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 00:41:18,530 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-03 00:41:18,530 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 00:41:18,530 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 00:41:18,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:18,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,150 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-12-03 00:41:19,260 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 00:41:19,263 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-03 00:41:19,264 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-12-03 00:41:19,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:19,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:19,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:19,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:19,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:19,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:19,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:19,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:19,269 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-12-03 00:41:19,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:19,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:19,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:19,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:19,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:19,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:19,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:19,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:19,271 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-12-03 00:41:19,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:19,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:19,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:19,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:19,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:19,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:19,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:19,276 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-12-03 00:41:19,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:19,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:19,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:19,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:19,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:19,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:19,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:19,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:19,278 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-12-03 00:41:19,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:19,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:19,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:19,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:19,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:19,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:19,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:19,281 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-12-03 00:41:19,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:19,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:19,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:19,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:19,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:19,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:19,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:19,291 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-12-03 00:41:19,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:19,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:19,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:19,292 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-03 00:41:19,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:19,294 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 00:41:19,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:19,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:19,303 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-12-03 00:41:19,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:19,304 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:41:19,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:19,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:19,306 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 00:41:19,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:19,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:19,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:41:19,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:19,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:19,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:19,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:19,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:19,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:19,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:19,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:41:19,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:19,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:19,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:19,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:19,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:19,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:19,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:19,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:41:19,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:19,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:19,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:19,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:19,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:19,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:19,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:19,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:19,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:41:19,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:19,333 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:41:19,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:19,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:19,334 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 00:41:19,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:19,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:19,340 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-12-03 00:41:19,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:19,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:19,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:19,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:19,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:19,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:19,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:19,344 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-12-03 00:41:19,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:19,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:19,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:19,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:19,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:19,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:19,356 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-03 00:41:19,366 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-03 00:41:19,366 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-03 00:41:19,368 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-03 00:41:19,369 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-03 00:41:19,369 INFO L518 LassoAnalysis]: Proved termination. [2018-12-03 00:41:19,369 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-12-03 00:41:19,406 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-03 00:41:19,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-03 00:41:19,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:41:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:41:19,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:41:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:41:19,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:41:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:41:19,468 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-12-03 00:41:19,469 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-03 00:41:19,506 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-12-03 00:41:19,507 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-12-03 00:41:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-03 00:41:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-03 00:41:19,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-03 00:41:19,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:41:19,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-12-03 00:41:19,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:41:19,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-12-03 00:41:19,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:41:19,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-03 00:41:19,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-03 00:41:19,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-12-03 00:41:19,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-03 00:41:19,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-03 00:41:19,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-03 00:41:19,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-03 00:41:19,511 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-03 00:41:19,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-03 00:41:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 00:41:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 00:41:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-12-03 00:41:19,512 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-03 00:41:19,512 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-03 00:41:19,512 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-03 00:41:19,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-12-03 00:41:19,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-03 00:41:19,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 00:41:19,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 00:41:19,513 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:41:19,513 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-03 00:41:19,513 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 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; 178#L558 assume !(main_~length1~0 < 1); 179#L558-2 assume !(main_~length2~0 < 1); 184#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);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 195#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 188#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 185#L548-5 [2018-12-03 00:41:19,513 INFO L796 eck$LassoCheckResult]: Loop: 185#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 180#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 181#L548-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 185#L548-5 [2018-12-03 00:41:19,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:41:19,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-12-03 00:41:19,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:41:19,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:41:19,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:19,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:41:19,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:19,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:41:19,527 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-12-03 00:41:19,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:41:19,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:41:19,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:19,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:41:19,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:19,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:41:19,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-12-03 00:41:19,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:41:19,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:41:19,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:19,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:41:19,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:19,855 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-12-03 00:41:19,922 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 00:41:19,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 00:41:19,922 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 00:41:19,922 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 00:41:19,922 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-03 00:41:19,922 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 00:41:19,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 00:41:19,923 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 00:41:19,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-03 00:41:19,923 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 00:41:19,923 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 00:41:19,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:19,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:20,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:20,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:41:20,512 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-12-03 00:41:20,552 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 00:41:20,552 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-03 00:41:20,553 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-12-03 00:41:20,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:20,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:20,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:20,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,555 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-12-03 00:41:20,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:20,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:20,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:20,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,556 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-12-03 00:41:20,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:20,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:20,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:20,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,557 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-12-03 00:41:20,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:20,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:20,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:20,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,558 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-12-03 00:41:20,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:20,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:20,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:20,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,559 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-12-03 00:41:20,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:20,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:20,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,561 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-12-03 00:41:20,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:20,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:20,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:20,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,563 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-12-03 00:41:20,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:20,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:20,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,565 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-12-03 00:41:20,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:20,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:20,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:20,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,567 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-12-03 00:41:20,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:20,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:20,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:20,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,569 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-12-03 00:41:20,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:20,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:20,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:20,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,570 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-12-03 00:41:20,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:20,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:20,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:20,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,572 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-12-03 00:41:20,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:20,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:20,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:20,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,573 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-12-03 00:41:20,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:20,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:20,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:20,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,575 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-12-03 00:41:20,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:41:20,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:41:20,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:41:20,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,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-12-03 00:41:20,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:20,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:20,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,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-12-03 00:41:20,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:20,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:20,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,588 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-12-03 00:41:20,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,588 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:41:20,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,590 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 00:41:20,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:20,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,596 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-12-03 00:41:20,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:20,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:20,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,599 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-12-03 00:41:20,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,600 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:41:20,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,601 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 00:41:20,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:20,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,608 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-12-03 00:41:20,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:20,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:20,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,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-12-03 00:41:20,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:20,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:20,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,615 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-12-03 00:41:20,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,615 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:41:20,615 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-03 00:41:20,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,633 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-12-03 00:41:20,633 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-12-03 00:41:20,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:41:20,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:41:20,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:41:20,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:41:20,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:41:20,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:41:20,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:41:20,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:41:20,699 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-03 00:41:20,706 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-03 00:41:20,706 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-03 00:41:20,707 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-03 00:41:20,707 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-03 00:41:20,707 INFO L518 LassoAnalysis]: Proved termination. [2018-12-03 00:41:20,707 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-12-03 00:41:20,740 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-12-03 00:41:20,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-03 00:41:20,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:41:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:41:20,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:41:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:41:20,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:41:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:41:20,802 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-12-03 00:41:20,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-03 00:41:20,835 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-12-03 00:41:20,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-03 00:41:20,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-03 00:41:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-03 00:41:20,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-03 00:41:20,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:41:20,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-03 00:41:20,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:41:20,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-03 00:41:20,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:41:20,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-12-03 00:41:20,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-03 00:41:20,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-12-03 00:41:20,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-03 00:41:20,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-03 00:41:20,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-12-03 00:41:20,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-03 00:41:20,838 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-12-03 00:41:20,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-12-03 00:41:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-03 00:41:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 00:41:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-03 00:41:20,839 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-03 00:41:20,839 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-03 00:41:20,839 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-03 00:41:20,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-12-03 00:41:20,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-03 00:41:20,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 00:41:20,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 00:41:20,840 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:41:20,840 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-03 00:41:20,840 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 371#L-1 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; 358#L558 assume !(main_~length1~0 < 1); 359#L558-2 assume !(main_~length2~0 < 1); 364#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);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 376#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 377#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 379#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 380#L548-1 assume !cstrcspn_#t~short7; 366#L548-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6; 367#L548-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 372#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 373#L545-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 374#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 368#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 365#L548-5 [2018-12-03 00:41:20,840 INFO L796 eck$LassoCheckResult]: Loop: 365#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 360#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 361#L548-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 365#L548-5 [2018-12-03 00:41:20,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:41:20,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-12-03 00:41:20,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:41:20,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:41:20,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:20,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:41:20,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:20,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:41:20,852 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-12-03 00:41:20,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:41:20,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:41:20,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:20,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:41:20,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:41:20,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:41:20,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2018-12-03 00:41:20,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:41:20,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:41:20,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:20,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 00:41:20,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:41:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:41:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:41:20,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:41:20,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afd50236-f5b3-4bff-9225-9daec73ae423/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 00:41:20,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:41:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:41:20,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:41:20,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-12-03 00:41:20,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-03 00:41:20,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:41:20,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-12-03 00:41:20,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-03 00:41:20,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:41:21,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-03 00:41:21,009 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:41:21,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:41:21,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:41:21,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-03 00:41:21,022 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-12-03 00:41:58,261 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 00:42:23,351 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 00:42:37,986 WARN L180 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 00:42:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:42:38,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 00:42:38,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-12-03 00:42:38,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 00:42:38,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2018-12-03 00:42:38,115 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-12-03 00:42:40,932 WARN L180 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2018-12-03 00:42:44,441 WARN L180 SmtUtils]: Spent 3.50 s on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-12-03 00:42:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:42:44,486 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-12-03 00:42:44,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 00:42:44,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2018-12-03 00:42:44,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-03 00:42:44,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2018-12-03 00:42:44,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-03 00:42:44,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-03 00:42:44,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-12-03 00:42:44,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-03 00:42:44,488 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-12-03 00:42:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-12-03 00:42:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-12-03 00:42:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 00:42:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-03 00:42:44,490 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-03 00:42:44,491 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-03 00:42:44,491 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-03 00:42:44,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-12-03 00:42:44,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-03 00:42:44,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 00:42:44,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 00:42:44,491 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:42:44,491 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-03 00:42:44,491 INFO L794 eck$LassoCheckResult]: Stem: 539#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 534#L-1 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; 519#L558 assume !(main_~length1~0 < 1); 520#L558-2 assume !(main_~length2~0 < 1); 525#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);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 540#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 541#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 543#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 523#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 524#L548-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6; 535#L548-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 536#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 537#L545-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 538#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 529#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 526#L548-5 [2018-12-03 00:42:44,491 INFO L796 eck$LassoCheckResult]: Loop: 526#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 521#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 522#L548-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 526#L548-5 [2018-12-03 00:42:44,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:42:44,492 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-12-03 00:42:44,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:42:44,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:42:44,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:42:44,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:42:44,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:42:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:42:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:42:44,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:42:44,510 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-12-03 00:42:44,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:42:44,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:42:44,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:42:44,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 00:42:44,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:42:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:42:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:42:44,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:42:44,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-12-03 00:42:44,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:42:44,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:42:44,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:42:44,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 00:42:44,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:42:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:42:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:42:44,968 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 134 [2018-12-03 00:42:45,682 WARN L180 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2018-12-03 00:42:45,683 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 00:42:45,684 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 00:42:45,684 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 00:42:45,684 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 00:42:45,684 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-03 00:42:45,684 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 00:42:45,684 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 00:42:45,684 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 00:42:45,684 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-12-03 00:42:45,684 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 00:42:45,684 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 00:42:45,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:45,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:45,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:45,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:45,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:45,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:45,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:45,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:45,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:45,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:45,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:45,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:45,823 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-03 00:42:46,174 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2018-12-03 00:42:46,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:46,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:46,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:46,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:46,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:46,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 00:42:46,682 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 120 [2018-12-03 00:42:46,749 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-03 00:42:51,033 WARN L180 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 176 DAG size of output: 125 [2018-12-03 00:42:51,656 WARN L180 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2018-12-03 00:42:51,663 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 00:42:51,663 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-03 00:42:51,663 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-12-03 00:42:51,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:42:51,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:42:51,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:42:51,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,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-12-03 00:42:51,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:42:51,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:42:51,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:42:51,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:42:51,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:42:51,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:42:51,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,667 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-12-03 00:42:51,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:42:51,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:42:51,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:42:51,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,668 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-12-03 00:42:51,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:42:51,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:42:51,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:42:51,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:42:51,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:42:51,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:42:51,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:42:51,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:42:51,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:42:51,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:42:51,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:42:51,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:42:51,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:42:51,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:42:51,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,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-12-03 00:42:51,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:42:51,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:42:51,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:42:51,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,674 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-12-03 00:42:51,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:42:51,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:42:51,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:42:51,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:42:51,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 00:42:51,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 00:42:51,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 00:42:51,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 00:42:51,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:42:51,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:42:51,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,677 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-12-03 00:42:51,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:42:51,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:42:51,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,679 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-12-03 00:42:51,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:42:51,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:42:51,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,680 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-12-03 00:42:51,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,681 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 00:42:51,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,682 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 00:42:51,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:42:51,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,685 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-12-03 00:42:51,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 00:42:51,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 00:42:51,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 00:42:51,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 00:42:51,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 00:42:51,686 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-12-03 00:42:51,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 00:42:51,687 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2018-12-03 00:42:51,687 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-03 00:42:51,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 00:42:51,777 INFO L402 nArgumentSynthesizer]: We have 276 Motzkin's Theorem applications. [2018-12-03 00:42:51,778 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-12-03 00:42:55,379 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-03 00:42:57,889 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2018-12-03 00:42:57,889 INFO L444 ModelExtractionUtils]: 359 out of 378 variables were initially zero. Simplification set additionally 16 variables to zero. [2018-12-03 00:42:57,890 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-03 00:42:57,891 INFO L440 nArgumentSynthesizer]: Removed 12 redundant supporting invariants from a total of 12. [2018-12-03 00:42:57,892 INFO L518 LassoAnalysis]: Proved termination. [2018-12-03 00:42:57,892 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-12-03 00:42:57,962 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2018-12-03 00:42:57,963 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-03 00:42:57,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:42:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:42:57,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:42:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:42:57,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:42:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:42:58,004 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-12-03 00:42:58,004 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-03 00:42:58,029 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2018-12-03 00:42:58,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-03 00:42:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-03 00:42:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-03 00:42:58,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-03 00:42:58,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:42:58,029 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-03 00:42:58,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:42:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:42:58,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:42:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:42:58,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:42:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:42:58,074 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-12-03 00:42:58,074 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-03 00:42:58,098 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2018-12-03 00:42:58,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-03 00:42:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-03 00:42:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-03 00:42:58,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-03 00:42:58,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:42:58,099 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-03 00:42:58,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:42:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:42:58,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:42:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:42:58,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:42:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:42:58,155 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-12-03 00:42:58,155 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-03 00:42:58,176 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 45 states and 60 transitions. Complement of second has 5 states. [2018-12-03 00:42:58,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-03 00:42:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-03 00:42:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-03 00:42:58,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-03 00:42:58,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:42:58,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-03 00:42:58,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:42:58,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-03 00:42:58,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 00:42:58,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-12-03 00:42:58,179 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-03 00:42:58,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-12-03 00:42:58,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-03 00:42:58,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-03 00:42:58,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-03 00:42:58,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 00:42:58,179 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 00:42:58,179 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 00:42:58,179 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 00:42:58,179 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-03 00:42:58,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-03 00:42:58,179 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-03 00:42:58,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-03 00:42:58,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 03.12 12:42:58 BoogieIcfgContainer [2018-12-03 00:42:58,183 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-03 00:42:58,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 00:42:58,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 00:42:58,184 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 00:42:58,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:41:17" (3/4) ... [2018-12-03 00:42:58,186 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-03 00:42:58,186 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 00:42:58,187 INFO L168 Benchmark]: Toolchain (without parser) took 100943.70 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 912.3 MB). Free memory was 956.0 MB in the beginning and 894.9 MB in the end (delta: 61.1 MB). Peak memory consumption was 973.3 MB. Max. memory is 11.5 GB. [2018-12-03 00:42:58,187 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:42:58,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-03 00:42:58,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:42:58,188 INFO L168 Benchmark]: Boogie Preprocessor took 19.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:42:58,188 INFO L168 Benchmark]: RCFGBuilder took 188.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-03 00:42:58,188 INFO L168 Benchmark]: BuchiAutomizer took 100410.35 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 754.5 MB). Free memory was 1.1 GB in the beginning and 894.9 MB in the end (delta: 221.9 MB). Peak memory consumption was 976.4 MB. Max. memory is 11.5 GB. [2018-12-03 00:42:58,189 INFO L168 Benchmark]: Witness Printer took 2.75 ms. Allocated memory is still 1.9 GB. Free memory is still 894.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:42:58,190 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 188.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 100410.35 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 754.5 MB). Free memory was 1.1 GB in the beginning and 894.9 MB in the end (delta: 221.9 MB). Peak memory consumption was 976.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.75 ms. Allocated memory is still 1.9 GB. Free memory is still 894.9 MB. 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 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 100.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 93.4s. Construction of modules took 0.1s. Büchi inclusion checks took 6.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 151 SDslu, 110 SDs, 0 SdLazy, 154 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital366 mio100 ax100 hnf99 lsp92 ukn71 mio100 lsp69 div125 bol100 ite100 ukn100 eq169 hnf83 smp79 dnf1846 smp25 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 6205ms VariablesStem: 30 VariablesLoop: 19 DisjunctsStem: 16 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 276 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...