./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a873a592-5b54-4080-a5bd-72ca4c458edc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a873a592-5b54-4080-a5bd-72ca4c458edc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a873a592-5b54-4080-a5bd-72ca4c458edc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a873a592-5b54-4080-a5bd-72ca4c458edc/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_a873a592-5b54-4080-a5bd-72ca4c458edc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a873a592-5b54-4080-a5bd-72ca4c458edc/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-aa41828 [2018-11-22 22:15:55,512 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:15:55,513 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:15:55,519 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:15:55,519 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:15:55,520 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:15:55,521 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:15:55,522 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:15:55,523 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:15:55,524 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:15:55,524 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:15:55,524 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:15:55,525 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:15:55,526 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:15:55,526 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:15:55,527 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:15:55,527 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:15:55,528 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:15:55,529 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:15:55,530 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:15:55,531 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:15:55,532 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:15:55,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:15:55,534 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:15:55,534 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:15:55,534 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:15:55,535 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:15:55,536 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:15:55,536 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:15:55,537 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:15:55,537 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:15:55,538 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:15:55,538 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:15:55,538 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:15:55,539 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:15:55,539 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:15:55,539 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a873a592-5b54-4080-a5bd-72ca4c458edc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 22:15:55,550 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:15:55,551 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:15:55,552 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:15:55,552 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:15:55,552 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:15:55,552 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:15:55,552 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:15:55,552 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:15:55,552 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:15:55,553 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:15:55,553 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:15:55,553 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:15:55,553 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:15:55,553 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:15:55,553 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:15:55,553 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:15:55,553 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:15:55,554 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:15:55,554 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:15:55,554 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:15:55,554 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:15:55,554 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:15:55,554 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:15:55,554 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:15:55,554 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:15:55,555 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:15:55,555 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:15:55,555 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:15:55,555 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:15:55,555 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:15:55,555 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:15:55,556 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:15:55,556 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_a873a592-5b54-4080-a5bd-72ca4c458edc/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-11-22 22:15:55,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:15:55,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:15:55,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:15:55,593 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:15:55,593 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:15:55,593 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a873a592-5b54-4080-a5bd-72ca4c458edc/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-22 22:15:55,641 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a873a592-5b54-4080-a5bd-72ca4c458edc/bin-2019/uautomizer/data/56d60c84e/68bf8b12f00541d497f0badcc2270507/FLAG3cd729761 [2018-11-22 22:15:56,015 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:15:56,016 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a873a592-5b54-4080-a5bd-72ca4c458edc/sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-22 22:15:56,025 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a873a592-5b54-4080-a5bd-72ca4c458edc/bin-2019/uautomizer/data/56d60c84e/68bf8b12f00541d497f0badcc2270507/FLAG3cd729761 [2018-11-22 22:15:56,419 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a873a592-5b54-4080-a5bd-72ca4c458edc/bin-2019/uautomizer/data/56d60c84e/68bf8b12f00541d497f0badcc2270507 [2018-11-22 22:15:56,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:15:56,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:15:56,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:15:56,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:15:56,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:15:56,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:15:56" (1/1) ... [2018-11-22 22:15:56,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aedd9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:56, skipping insertion in model container [2018-11-22 22:15:56,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:15:56" (1/1) ... [2018-11-22 22:15:56,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:15:56,473 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:15:56,657 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:15:56,664 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:15:56,732 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:15:56,754 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:15:56,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:56 WrapperNode [2018-11-22 22:15:56,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:15:56,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:15:56,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:15:56,755 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:15:56,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:56" (1/1) ... [2018-11-22 22:15:56,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:56" (1/1) ... [2018-11-22 22:15:56,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:15:56,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:15:56,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:15:56,786 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:15:56,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:56" (1/1) ... [2018-11-22 22:15:56,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:56" (1/1) ... [2018-11-22 22:15:56,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:56" (1/1) ... [2018-11-22 22:15:56,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:56" (1/1) ... [2018-11-22 22:15:56,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:56" (1/1) ... [2018-11-22 22:15:56,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:56" (1/1) ... [2018-11-22 22:15:56,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:56" (1/1) ... [2018-11-22 22:15:56,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:15:56,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:15:56,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:15:56,803 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:15:56,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a873a592-5b54-4080-a5bd-72ca4c458edc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:15:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:15:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:15:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:15:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:15:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:15:56,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:15:57,019 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:15:57,019 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-22 22:15:57,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:15:57 BoogieIcfgContainer [2018-11-22 22:15:57,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:15:57,020 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:15:57,020 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:15:57,023 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:15:57,024 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:15:57,024 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:15:56" (1/3) ... [2018-11-22 22:15:57,025 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f93f541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:15:57, skipping insertion in model container [2018-11-22 22:15:57,025 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:15:57,025 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:15:56" (2/3) ... [2018-11-22 22:15:57,025 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f93f541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:15:57, skipping insertion in model container [2018-11-22 22:15:57,026 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:15:57,026 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:15:57" (3/3) ... [2018-11-22 22:15:57,028 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-22 22:15:57,071 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:15:57,071 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:15:57,071 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:15:57,071 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:15:57,071 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:15:57,071 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:15:57,071 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:15:57,072 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:15:57,072 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:15:57,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-22 22:15:57,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 22:15:57,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:15:57,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:15:57,104 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:15:57,104 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 22:15:57,104 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:15:57,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-22 22:15:57,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 22:15:57,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:15:57,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:15:57,106 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:15:57,106 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 22:15:57,112 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-11-22 22:15:57,112 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-11-22 22:15:57,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:57,116 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-22 22:15:57,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:57,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:57,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:57,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:57,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:57,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:57,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-22 22:15:57,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:57,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:57,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:57,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:57,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:15:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:15:57,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:15:57,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:15:57,239 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:15:57,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 22:15:57,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 22:15:57,251 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-22 22:15:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:15:57,256 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-22 22:15:57,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 22:15:57,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-22 22:15:57,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 22:15:57,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-22 22:15:57,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-22 22:15:57,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-22 22:15:57,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-22 22:15:57,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:15:57,264 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-22 22:15:57,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-22 22:15:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-22 22:15:57,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-22 22:15:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-22 22:15:57,288 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-22 22:15:57,288 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-22 22:15:57,288 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:15:57,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-22 22:15:57,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 22:15:57,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:15:57,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:15:57,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:15:57,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:15:57,290 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-11-22 22:15:57,290 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~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7; 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-11-22 22:15:57,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:57,290 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-22 22:15:57,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:57,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:57,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:57,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:57,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:57,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:57,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-22 22:15:57,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:57,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:57,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:57,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:15:57,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:57,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:57,340 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-22 22:15:57,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:57,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:57,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:57,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:57,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:57,560 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-22 22:15:57,832 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-22 22:15:57,973 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-22 22:15:58,048 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:15:58,049 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:15:58,049 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:15:58,049 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:15:58,049 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:15:58,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:15:58,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:15:58,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:15:58,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-22 22:15:58,050 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:15:58,051 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:15:58,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:58,722 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-11-22 22:15:58,868 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:15:58,873 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:15:58,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:58,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:58,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:58,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:58,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:58,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:58,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:58,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:58,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:58,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:58,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:58,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:58,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:58,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:58,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:58,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:58,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:58,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:58,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:58,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:58,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:58,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:58,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:58,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:58,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:58,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:58,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:58,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:58,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:58,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:58,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:58,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:58,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:58,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:58,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:58,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:58,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:58,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:58,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:58,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:58,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:58,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:58,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:58,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:58,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:58,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:58,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:58,926 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-22 22:15:58,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,929 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:15:58,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:58,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:58,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:58,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:58,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:58,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:58,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:58,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,952 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:15:58,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:58,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,955 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:15:58,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:58,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:58,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:58,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:58,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:58,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:58,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:58,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:15:58,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:58,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:58,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:15:58,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:15:58,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:58,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:58,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:58,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:58,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:58,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:58,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:58,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:58,993 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:15:58,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:58,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:58,995 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:15:58,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:59,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:59,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:59,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:59,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:59,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:59,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:59,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:59,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:59,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:15:59,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:15:59,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:15:59,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:15:59,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:15:59,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:15:59,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:15:59,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:15:59,030 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:15:59,043 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:15:59,043 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-22 22:15:59,045 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:15:59,046 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:15:59,046 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:15:59,047 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-11-22 22:15:59,081 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-22 22:15:59,088 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:15:59,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:15:59,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:15:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:15:59,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:15:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:15:59,195 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:15:59,196 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-22 22:15:59,267 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-11-22 22:15:59,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 22:15:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:15:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-22 22:15:59,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-22 22:15:59,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:15:59,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-22 22:15:59,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:15:59,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-22 22:15:59,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:15:59,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-22 22:15:59,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:15:59,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-22 22:15:59,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-22 22:15:59,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-22 22:15:59,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-22 22:15:59,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:15:59,273 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-22 22:15:59,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-22 22:15:59,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-22 22:15:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-22 22:15:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-22 22:15:59,274 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-22 22:15:59,274 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-22 22:15:59,274 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:15:59,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-22 22:15:59,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:15:59,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:15:59,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:15:59,275 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:15:59,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:15:59,276 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-11-22 22:15:59,276 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~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;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-11-22 22:15:59,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:59,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-22 22:15:59,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:59,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:59,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:59,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:59,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:59,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:59,296 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-22 22:15:59,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:59,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:59,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:59,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:59,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:59,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:15:59,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-22 22:15:59,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:15:59,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:15:59,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:59,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:15:59,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:15:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:15:59,715 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-11-22 22:15:59,778 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:15:59,778 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:15:59,778 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:15:59,778 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:15:59,778 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:15:59,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:15:59,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:15:59,778 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:15:59,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-22 22:15:59,778 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:15:59,778 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:15:59,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:59,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:59,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:59,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:59,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:59,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:59,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:59,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:15:59,961 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2018-11-22 22:16:00,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:16:00,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:16:00,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:16:00,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:16:00,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:16:00,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:16:00,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:16:00,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:16:00,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:16:00,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:16:00,365 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-22 22:16:00,412 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:16:00,412 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:16:00,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:16:00,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:16:00,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:16:00,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:16:00,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:16:00,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:16:00,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:16:00,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:16:00,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:16:00,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:16:00,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:16:00,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:16:00,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:16:00,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:16:00,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:16:00,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:16:00,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:16:00,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:16:00,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:16:00,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:16:00,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:16:00,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:16:00,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:16:00,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:16:00,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:16:00,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:16:00,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:16:00,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:16:00,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:16:00,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:16:00,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:16:00,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:16:00,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:16:00,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:16:00,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:16:00,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:16:00,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:16:00,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:16:00,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:16:00,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:16:00,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:16:00,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:16:00,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:16:00,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:16:00,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:16:00,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:16:00,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:16:00,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:16:00,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:16:00,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:16:00,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:16:00,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:16:00,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:16:00,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:16:00,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:16:00,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:16:00,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:16:00,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:16:00,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:16:00,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:16:00,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:16:00,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:16:00,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:16:00,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:16:00,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:16:00,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:16:00,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:16:00,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:16:00,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:16:00,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:16:00,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:16:00,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:16:00,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:16:00,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:16:00,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:16:00,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:16:00,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:16:00,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:16:00,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:16:00,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:16:00,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:16:00,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:16:00,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:16:00,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:16:00,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:16:00,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:16:00,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:16:00,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:16:00,442 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:16:00,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:16:00,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:16:00,443 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:16:00,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:16:00,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:16:00,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:16:00,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:16:00,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:16:00,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:16:00,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:16:00,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:16:00,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:16:00,469 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:16:00,484 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-22 22:16:00,484 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-22 22:16:00,484 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:16:00,485 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:16:00,485 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:16:00,485 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-11-22 22:16:00,544 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-22 22:16:00,546 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:16:00,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:16:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:16:00,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:16:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:16:00,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:16:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:16:00,610 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-22 22:16:00,611 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-22 22:16:00,684 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-11-22 22:16:00,685 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-11-22 22:16:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:16:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-22 22:16:00,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-22 22:16:00,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:16:00,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-22 22:16:00,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:16:00,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-22 22:16:00,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:16:00,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-22 22:16:00,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:16:00,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-22 22:16:00,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-22 22:16:00,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 22:16:00,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-22 22:16:00,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:16:00,688 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-22 22:16:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-22 22:16:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-22 22:16:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-22 22:16:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-22 22:16:00,691 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-22 22:16:00,691 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-22 22:16:00,691 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 22:16:00,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-22 22:16:00,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:16:00,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:16:00,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:16:00,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:16:00,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:16:00,698 INFO L794 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 363#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; 350#L558 assume !(main_~length1~0 < 1); 351#L558-2 assume !(main_~length2~0 < 1); 356#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; 368#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 369#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; 371#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 372#L548-1 assume !cstrcspn_#t~short7; 358#L548-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7; 359#L548-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 364#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 365#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; 366#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 360#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; 357#L548-5 [2018-11-22 22:16:00,698 INFO L796 eck$LassoCheckResult]: Loop: 357#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 352#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); 353#L548-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;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; 357#L548-5 [2018-11-22 22:16:00,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:16:00,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-22 22:16:00,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:16:00,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:16:00,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:16:00,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:16:00,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:16:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:16:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:16:00,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:16:00,719 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-22 22:16:00,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:16:00,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:16:00,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:16:00,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:16:00,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:16:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:16:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:16:00,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:16:00,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2018-11-22 22:16:00,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:16:00,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:16:00,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:16:00,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:16:00,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:16:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:16:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:16:00,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:16:00,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a873a592-5b54-4080-a5bd-72ca4c458edc/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:16:00,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:16:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:16:00,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:16:00,867 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-11-22 22:16:00,870 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-11-22 22:16:00,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:16:00,895 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-11-22 22:16:00,901 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-11-22 22:16:00,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 22:16:00,919 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-11-22 22:16:00,919 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-22 22:16:00,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:16:00,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:16:00,937 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-11-22 22:16:00,938 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-11-22 22:16:38,264 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-22 22:17:04,647 WARN L180 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-22 22:17:20,255 WARN L180 SmtUtils]: Spent 1.95 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-22 22:17:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:17:20,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:17:20,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-22 22:17:20,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 22:17:20,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2018-11-22 22:17:20,376 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-11-22 22:17:22,352 WARN L180 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2018-11-22 22:17:24,671 WARN L180 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-11-22 22:17:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:17:24,711 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-11-22 22:17:24,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:17:24,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2018-11-22 22:17:24,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:17:24,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2018-11-22 22:17:24,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-22 22:17:24,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-22 22:17:24,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-11-22 22:17:24,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:17:24,714 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-22 22:17:24,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-11-22 22:17:24,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-11-22 22:17:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-22 22:17:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-11-22 22:17:24,716 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-22 22:17:24,716 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-22 22:17:24,716 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 22:17:24,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-11-22 22:17:24,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:17:24,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:17:24,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:17:24,717 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:17:24,718 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:17:24,718 INFO L794 eck$LassoCheckResult]: Stem: 530#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 525#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; 511#L558 assume !(main_~length1~0 < 1); 512#L558-2 assume !(main_~length2~0 < 1); 517#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; 531#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 532#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; 535#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 515#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); 516#L548-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7; 526#L548-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 527#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 528#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; 529#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 521#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; 518#L548-5 [2018-11-22 22:17:24,718 INFO L796 eck$LassoCheckResult]: Loop: 518#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 513#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); 514#L548-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;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; 518#L548-5 [2018-11-22 22:17:24,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:17:24,718 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-22 22:17:24,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:17:24,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:17:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:17:24,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:17:24,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:17:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:17:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:17:24,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:17:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-22 22:17:24,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:17:24,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:17:24,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:17:24,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:17:24,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:17:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:17:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:17:24,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:17:24,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-22 22:17:24,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:17:24,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:17:24,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:17:24,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:17:24,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:17:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:17:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:17:25,297 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 133 [2018-11-22 22:17:25,921 WARN L180 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2018-11-22 22:17:25,922 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:17:25,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:17:25,923 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:17:25,923 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:17:25,923 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:17:25,923 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:17:25,923 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:17:25,923 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:17:25,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-22 22:17:25,923 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:17:25,923 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:17:25,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:25,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:25,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:25,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:25,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:25,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-11-22 22:17:25,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-11-22 22:17:26,116 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-22 22:17:26,519 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2018-11-22 22:17:26,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:26,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:26,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:26,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:26,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:26,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:26,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:26,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:26,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:26,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:26,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:26,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:17:27,296 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-11-22 22:17:27,399 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:17:27,400 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:17:27,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:17:27,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:17:27,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:17:27,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:17:27,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:17:27,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:17:27,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:17:27,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:17:27,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:17:27,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:17:27,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:17:27,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:17:27,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:17:27,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:17:27,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:17:27,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:17:27,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:17:27,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:17:27,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:17:27,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:17:27,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:17:27,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:17:27,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:17:27,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:17:27,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:17:27,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:17:27,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:17:27,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:17:27,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:17:27,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:17:27,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:17:27,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:17:27,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:17:27,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:17:27,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:17:27,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:17:27,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:17:27,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:17:27,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:17:27,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:17:27,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:17:27,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:17:27,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:17:27,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:17:27,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:17:27,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:17:27,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:17:27,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:17:27,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:17:27,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:17:27,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:17:27,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:17:27,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:17:27,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:17:27,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:17:27,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:17:27,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:17:27,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:17:27,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:17:27,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:17:27,427 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:17:27,438 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 22:17:27,438 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:17:27,439 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:17:27,439 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:17:27,440 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:17:27,440 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-11-22 22:17:27,557 INFO L297 tatePredicateManager]: 32 out of 33 supporting invariants were superfluous and have been removed [2018-11-22 22:17:27,558 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:17:27,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:17:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:17:27,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:17:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:17:27,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:17:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:17:27,653 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-22 22:17:27,653 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-22 22:17:27,680 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-11-22 22:17:27,680 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-11-22 22:17:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:17:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-22 22:17:27,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-22 22:17:27,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:17:27,681 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:17:27,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:17:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:17:27,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:17:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:17:27,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:17:27,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:17:27,720 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-22 22:17:27,720 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-22 22:17:27,742 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-11-22 22:17:27,742 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-11-22 22:17:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:17:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-22 22:17:27,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-22 22:17:27,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:17:27,743 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:17:27,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:17:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:17:27,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:17:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:17:27,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:17:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:17:27,787 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-22 22:17:27,787 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-22 22:17:27,811 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-11-22 22:17:27,812 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-11-22 22:17:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:17:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-22 22:17:27,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-22 22:17:27,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:17:27,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-22 22:17:27,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:17:27,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-22 22:17:27,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:17:27,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-11-22 22:17:27,815 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:17:27,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-11-22 22:17:27,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 22:17:27,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 22:17:27,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 22:17:27,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:17:27,815 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:17:27,815 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:17:27,816 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:17:27,816 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 22:17:27,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:17:27,816 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:17:27,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 22:17:27,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:17:27 BoogieIcfgContainer [2018-11-22 22:17:27,820 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:17:27,821 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:17:27,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:17:27,821 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:17:27,821 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:15:57" (3/4) ... [2018-11-22 22:17:27,823 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:17:27,823 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:17:27,824 INFO L168 Benchmark]: Toolchain (without parser) took 91396.89 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 368.6 MB). Free memory was 950.4 MB in the beginning and 1.2 GB in the end (delta: -292.2 MB). Peak memory consumption was 76.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:17:27,825 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:17:27,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:17:27,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.86 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:17:27,826 INFO L168 Benchmark]: Boogie Preprocessor took 16.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:17:27,826 INFO L168 Benchmark]: RCFGBuilder took 216.86 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: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2018-11-22 22:17:27,826 INFO L168 Benchmark]: BuchiAutomizer took 90800.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.8 MB). Peak memory consumption was 90.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:17:27,827 INFO L168 Benchmark]: Witness Printer took 2.91 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:17:27,829 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.86 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.65 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 216.86 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: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 90800.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.8 MB). Peak memory consumption was 90.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.91 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.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 90.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 85.7s. Construction of modules took 0.1s. Büchi inclusion checks took 4.7s. 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, 136 SDslu, 98 SDs, 0 SdLazy, 155 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax100 hnf99 lsp91 ukn71 mio100 lsp30 div137 bol100 ite100 ukn100 eq160 hnf77 smp91 dnf1075 smp24 tf100 neg95 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 0 MotzkinApplications: 8 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...