./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 64bit --witnessprinter.graph.data.programhash fcd11173df80f9a00fde2714abfd2a4ff8d40757 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:43:06,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:43:06,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:43:06,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:43:06,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:43:06,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:43:06,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:43:06,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:43:06,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:43:06,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:43:06,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:43:06,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:43:06,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:43:06,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:43:06,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:43:06,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:43:06,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:43:06,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:43:06,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:43:06,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:43:06,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:43:06,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:43:06,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:43:06,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:43:06,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:43:06,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:43:06,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:43:06,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:43:06,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:43:06,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:43:06,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:43:06,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:43:06,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:43:06,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:43:06,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:43:06,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:43:06,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:43:06,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:43:06,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:43:06,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:43:06,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:43:06,804 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:43:06,848 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:43:06,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:43:06,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:43:06,850 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:43:06,851 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:43:06,851 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:43:06,851 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:43:06,851 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:43:06,852 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:43:06,852 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:43:06,853 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:43:06,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:43:06,854 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:43:06,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:43:06,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:43:06,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:43:06,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:43:06,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:43:06,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:43:06,857 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:43:06,857 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:43:06,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:43:06,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:43:06,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:43:06,858 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:43:06,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:43:06,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:43:06,859 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:43:06,859 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:43:06,861 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:43:06,861 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcd11173df80f9a00fde2714abfd2a4ff8d40757 [2020-10-20 06:43:07,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:43:07,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:43:07,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:43:07,087 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:43:07,090 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:43:07,092 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2020-10-20 06:43:07,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4d2831e/c130793848ad4f2fae0ea155e7880ec6/FLAG7cdf5a303 [2020-10-20 06:43:07,798 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:43:07,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2020-10-20 06:43:07,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4d2831e/c130793848ad4f2fae0ea155e7880ec6/FLAG7cdf5a303 [2020-10-20 06:43:07,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4d2831e/c130793848ad4f2fae0ea155e7880ec6 [2020-10-20 06:43:07,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:43:07,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:43:07,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:43:07,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:43:07,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:43:07,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:43:07" (1/1) ... [2020-10-20 06:43:07,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d16fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:07, skipping insertion in model container [2020-10-20 06:43:07,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:43:07" (1/1) ... [2020-10-20 06:43:07,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:43:08,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:43:08,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:43:08,434 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:43:08,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:43:08,599 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:43:08,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:08 WrapperNode [2020-10-20 06:43:08,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:43:08,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:43:08,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:43:08,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:43:08,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:08" (1/1) ... [2020-10-20 06:43:08,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:08" (1/1) ... [2020-10-20 06:43:08,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:43:08,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:43:08,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:43:08,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:43:08,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:08" (1/1) ... [2020-10-20 06:43:08,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:08" (1/1) ... [2020-10-20 06:43:08,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:08" (1/1) ... [2020-10-20 06:43:08,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:08" (1/1) ... [2020-10-20 06:43:08,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:08" (1/1) ... [2020-10-20 06:43:08,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:08" (1/1) ... [2020-10-20 06:43:08,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:08" (1/1) ... [2020-10-20 06:43:08,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:43:08,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:43:08,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:43:08,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:43:08,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:43:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:43:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:43:08,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:43:08,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:43:08,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:43:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:43:09,153 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:43:09,154 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-20 06:43:09,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:43:09 BoogieIcfgContainer [2020-10-20 06:43:09,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:43:09,158 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:43:09,159 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:43:09,163 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:43:09,164 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:43:09,164 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:43:07" (1/3) ... [2020-10-20 06:43:09,165 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e9b8859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:43:09, skipping insertion in model container [2020-10-20 06:43:09,166 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:43:09,166 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:08" (2/3) ... [2020-10-20 06:43:09,166 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e9b8859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:43:09, skipping insertion in model container [2020-10-20 06:43:09,167 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:43:09,167 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:43:09" (3/3) ... [2020-10-20 06:43:09,169 INFO L373 chiAutomizerObserver]: Analyzing ICFG cstrcspn_diffterm_alloca.i [2020-10-20 06:43:09,209 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:43:09,210 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:43:09,210 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:43:09,210 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:43:09,211 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:43:09,211 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:43:09,211 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:43:09,211 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:43:09,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-20 06:43:09,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:43:09,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:09,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:09,252 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:43:09,252 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:43:09,252 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:43:09,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-20 06:43:09,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:43:09,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:09,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:09,255 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:43:09,255 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:43:09,263 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 11#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, 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~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, 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; 6#L369-4true [2020-10-20 06:43:09,264 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2020-10-20 06:43:09,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:09,270 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-10-20 06:43:09,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:09,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526381661] [2020-10-20 06:43:09,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:09,419 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:09,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:09,476 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:09,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:09,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2020-10-20 06:43:09,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:09,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794927931] [2020-10-20 06:43:09,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:09,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:09,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794927931] [2020-10-20 06:43:09,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:43:09,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:43:09,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195973054] [2020-10-20 06:43:09,527 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:43:09,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:43:09,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 06:43:09,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 06:43:09,547 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-10-20 06:43:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:43:09,554 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-10-20 06:43:09,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 06:43:09,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-10-20 06:43:09,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:43:09,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2020-10-20 06:43:09,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 06:43:09,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 06:43:09,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-10-20 06:43:09,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:43:09,566 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-10-20 06:43:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-10-20 06:43:09,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-20 06:43:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-20 06:43:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-10-20 06:43:09,592 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-10-20 06:43:09,592 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-10-20 06:43:09,593 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:43:09,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-10-20 06:43:09,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:43:09,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:09,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:09,594 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:43:09,595 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:09,595 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, 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~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, 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; 47#L369-4 [2020-10-20 06:43:09,595 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2020-10-20 06:43:09,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:09,596 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2020-10-20 06:43:09,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:09,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965328209] [2020-10-20 06:43:09,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:09,617 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:09,635 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:09,641 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:09,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:09,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2020-10-20 06:43:09,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:09,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937620445] [2020-10-20 06:43:09,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:09,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:09,690 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:09,697 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:09,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:09,701 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2020-10-20 06:43:09,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:09,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302786673] [2020-10-20 06:43:09,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:09,777 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:09,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:09,866 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:10,090 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-10-20 06:43:10,570 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2020-10-20 06:43:10,716 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-10-20 06:43:10,735 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:43:10,736 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:43:10,736 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:43:10,736 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:43:10,737 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:43:10,737 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:10,741 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:43:10,741 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:43:10,742 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration2_Lasso [2020-10-20 06:43:10,742 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:43:10,742 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:43:10,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:10,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:10,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:10,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:11,124 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-10-20 06:43:11,323 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-10-20 06:43:11,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:11,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:11,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:11,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:11,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:11,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:11,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:11,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:11,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:11,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:11,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:11,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:11,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:11,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,123 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2020-10-20 06:43:12,210 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:43:12,216 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:12,232 INFO L120 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 [2020-10-20 06:43:12,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:12,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:12,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:12,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:12,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:12,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:12,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:12,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:12,280 INFO L120 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 [2020-10-20 06:43:12,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:12,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:12,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:12,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:12,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:12,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:12,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:43:12,325 INFO L120 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 [2020-10-20 06:43:12,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:12,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:12,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:12,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:12,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:12,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:12,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:12,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:12,354 INFO L120 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 [2020-10-20 06:43:12,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:12,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:12,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:12,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:12,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:12,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:12,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:43:12,421 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-20 06:43:12,421 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:43:12,443 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:12,450 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:43:12,450 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:43:12,451 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2020-10-20 06:43:12,563 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2020-10-20 06:43:12,572 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:43:12,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:12,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:43:12,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:12,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:43:12,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:12,665 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 [2020-10-20 06:43:12,666 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-10-20 06:43:12,717 INFO L75 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. [2020-10-20 06:43:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:43:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:43:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-10-20 06:43:12,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2020-10-20 06:43:12,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:12,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2020-10-20 06:43:12,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:12,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2020-10-20 06:43:12,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:12,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2020-10-20 06:43:12,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:43:12,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2020-10-20 06:43:12,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 06:43:12,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 06:43:12,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-10-20 06:43:12,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:43:12,727 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-10-20 06:43:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-10-20 06:43:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-20 06:43:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 06:43:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-10-20 06:43:12,729 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-10-20 06:43:12,729 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-10-20 06:43:12,730 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:43:12,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-10-20 06:43:12,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:43:12,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:12,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:12,731 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:12,731 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:43:12,732 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, 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~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, 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; 177#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 179#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 189#L372-5 [2020-10-20 06:43:12,732 INFO L796 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 184#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 189#L372-5 [2020-10-20 06:43:12,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:12,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2020-10-20 06:43:12,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:12,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146552343] [2020-10-20 06:43:12,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:12,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:12,761 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:12,765 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:12,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:12,766 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2020-10-20 06:43:12,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:12,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372202501] [2020-10-20 06:43:12,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:12,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:12,778 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:12,780 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:12,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:12,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2020-10-20 06:43:12,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:12,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957572256] [2020-10-20 06:43:12,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:12,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:12,825 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:12,830 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:12,955 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-10-20 06:43:13,403 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2020-10-20 06:43:13,578 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-20 06:43:13,581 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:43:13,581 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:43:13,581 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:43:13,581 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:43:13,582 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:43:13,582 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:13,582 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:43:13,582 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:43:13,582 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration3_Lasso [2020-10-20 06:43:13,582 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:43:13,582 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:43:13,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:13,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:13,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:13,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:13,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:13,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:13,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:13,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:14,012 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2020-10-20 06:43:14,168 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-10-20 06:43:14,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:14,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:14,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:14,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:14,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:14,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:14,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:14,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:14,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:14,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:14,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:14,464 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2020-10-20 06:43:15,007 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-10-20 06:43:15,037 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:43:15,037 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:15,045 INFO L120 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 [2020-10-20 06:43:15,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:15,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:15,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:15,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:15,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:15,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:15,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:15,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:15,074 INFO L120 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 [2020-10-20 06:43:15,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:15,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:15,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:15,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:15,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:15,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:15,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:15,123 INFO L120 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 [2020-10-20 06:43:15,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:15,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:15,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:15,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:15,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:15,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:15,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:15,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:15,153 INFO L120 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 [2020-10-20 06:43:15,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:15,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:15,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:15,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:15,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:15,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:15,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:15,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:15,186 INFO L120 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 [2020-10-20 06:43:15,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:15,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:15,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:15,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:15,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:15,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:15,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:15,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:15,212 INFO L120 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 [2020-10-20 06:43:15,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:15,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:15,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:15,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:15,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:15,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:15,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:15,243 INFO L120 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 [2020-10-20 06:43:15,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:15,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:15,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:15,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:15,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:15,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:15,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:15,289 INFO L120 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 [2020-10-20 06:43:15,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:15,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:15,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:15,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:15,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:15,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:15,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:15,358 INFO L120 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 [2020-10-20 06:43:15,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:15,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:15,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:15,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:15,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:15,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:15,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:15,394 INFO L120 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 [2020-10-20 06:43:15,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:15,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:15,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:15,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:15,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:15,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:15,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:15,423 INFO L120 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 [2020-10-20 06:43:15,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:15,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:15,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:15,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:15,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:15,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:15,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:15,452 INFO L120 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 [2020-10-20 06:43:15,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:15,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:15,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:15,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:15,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:15,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:15,487 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:43:15,529 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-20 06:43:15,529 INFO L444 ModelExtractionUtils]: 29 out of 49 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:15,539 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:43:15,554 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:43:15,555 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:43:15,555 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2020-10-20 06:43:15,648 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2020-10-20 06:43:15,650 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:43:15,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:15,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:43:15,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:15,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:43:15,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:15,734 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 [2020-10-20 06:43:15,734 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-20 06:43:15,785 INFO L75 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. [2020-10-20 06:43:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:43:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:43:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-10-20 06:43:15,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2020-10-20 06:43:15,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:15,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2020-10-20 06:43:15,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:15,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2020-10-20 06:43:15,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:15,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2020-10-20 06:43:15,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:43:15,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2020-10-20 06:43:15,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:43:15,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:43:15,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2020-10-20 06:43:15,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:43:15,793 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-10-20 06:43:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2020-10-20 06:43:15,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2020-10-20 06:43:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 06:43:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-10-20 06:43:15,805 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-10-20 06:43:15,805 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-10-20 06:43:15,805 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:43:15,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-10-20 06:43:15,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:43:15,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:15,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:15,808 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:15,808 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:43:15,808 INFO L794 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 370#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 371#L382 assume !(main_~length1~0 < 1); 372#L382-2 assume !(main_~length2~0 < 1); 369#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, 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~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, 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; 365#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 366#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 379#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 375#L372-1 assume !cstrcspn_#t~short210; 376#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 361#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 362#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 363#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 364#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 368#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 378#L372-5 [2020-10-20 06:43:15,808 INFO L796 eck$LassoCheckResult]: Loop: 378#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 373#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 374#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 378#L372-5 [2020-10-20 06:43:15,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:15,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2020-10-20 06:43:15,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:15,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009258184] [2020-10-20 06:43:15,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:15,829 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:15,858 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:15,876 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:15,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:15,877 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2020-10-20 06:43:15,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:15,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295155337] [2020-10-20 06:43:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:15,891 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:15,902 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:15,905 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:15,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:15,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2020-10-20 06:43:15,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:15,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967056237] [2020-10-20 06:43:15,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:16,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967056237] [2020-10-20 06:43:16,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677381855] [2020-10-20 06:43:16,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:43:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:16,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-20 06:43:16,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:16,220 INFO L350 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2020-10-20 06:43:16,221 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 21 [2020-10-20 06:43:16,222 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:43:16,232 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:43:16,236 INFO L545 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. [2020-10-20 06:43:16,237 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:43, output treesize:27 [2020-10-20 06:43:17,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:43:17,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:43:17,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:43:17,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:43:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:17,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:43:17,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-10-20 06:43:17,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378822597] [2020-10-20 06:43:17,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:43:17,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 06:43:17,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:43:17,799 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2020-10-20 06:43:24,032 WARN L193 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2020-10-20 06:43:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:43:24,143 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2020-10-20 06:43:24,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:43:24,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2020-10-20 06:43:24,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:43:24,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2020-10-20 06:43:24,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 06:43:24,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 06:43:24,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2020-10-20 06:43:24,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:43:24,150 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2020-10-20 06:43:24,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2020-10-20 06:43:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2020-10-20 06:43:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-20 06:43:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-10-20 06:43:24,154 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-10-20 06:43:24,154 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-10-20 06:43:24,154 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:43:24,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2020-10-20 06:43:24,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:43:24,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:24,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:24,157 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:24,157 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:43:24,157 INFO L794 eck$LassoCheckResult]: Stem: 537#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 530#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 531#L382 assume !(main_~length1~0 < 1); 532#L382-2 assume !(main_~length2~0 < 1); 529#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, 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~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, 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; 525#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 526#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 545#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 535#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 536#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 521#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 522#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 523#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 524#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 527#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 538#L372-5 [2020-10-20 06:43:24,157 INFO L796 eck$LassoCheckResult]: Loop: 538#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 533#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 534#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 538#L372-5 [2020-10-20 06:43:24,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:24,158 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2020-10-20 06:43:24,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:24,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052948475] [2020-10-20 06:43:24,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:24,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:24,207 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:24,212 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:24,212 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2020-10-20 06:43:24,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:24,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640164121] [2020-10-20 06:43:24,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:24,217 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:24,221 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:24,222 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:24,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2020-10-20 06:43:24,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:24,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695003445] [2020-10-20 06:43:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:24,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:24,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:24,274 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:25,137 WARN L193 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 138 [2020-10-20 06:43:25,422 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-20 06:43:25,424 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:43:25,424 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:43:25,424 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:43:25,424 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:43:25,424 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:43:25,425 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:25,425 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:43:25,425 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:43:25,425 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration5_Lasso [2020-10-20 06:43:25,425 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:43:25,425 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:43:25,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:25,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:25,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:25,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:25,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:25,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:25,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:25,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:26,609 WARN L193 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2020-10-20 06:43:26,770 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-10-20 06:43:26,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:26,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:26,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:26,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:26,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:26,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:26,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:26,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:26,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:26,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:26,991 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2020-10-20 06:43:27,162 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-10-20 06:43:28,421 WARN L193 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-10-20 06:43:28,683 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-10-20 06:43:28,790 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:43:28,790 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:28,800 INFO L120 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 [2020-10-20 06:43:28,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:28,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:28,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:28,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:28,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:28,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:28,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:28,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:28,824 INFO L120 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 [2020-10-20 06:43:28,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:28,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:28,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:28,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:28,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:28,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:28,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:28,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:28,853 INFO L120 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 [2020-10-20 06:43:28,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:28,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:28,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:28,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:28,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:28,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:28,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:28,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:28,879 INFO L120 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 [2020-10-20 06:43:28,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:28,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:28,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:28,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:28,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:28,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:28,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:28,906 INFO L120 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 [2020-10-20 06:43:28,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:28,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:28,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:28,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:28,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:28,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:28,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:28,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:28,948 INFO L120 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 [2020-10-20 06:43:28,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:28,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:28,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:28,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:28,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:28,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:28,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:28,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:43:28,995 INFO L120 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 [2020-10-20 06:43:28,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:28,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:28,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:28,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:28,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:28,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:28,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:29,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:29,028 INFO L120 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 [2020-10-20 06:43:29,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:29,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:29,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:29,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:29,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:29,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:29,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:29,064 INFO L120 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 [2020-10-20 06:43:29,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:29,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:29,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:29,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:29,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:29,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:29,107 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:43:29,223 INFO L443 ModelExtractionUtils]: Simplification made 36 calls to the SMT solver. [2020-10-20 06:43:29,223 INFO L444 ModelExtractionUtils]: 11 out of 52 variables were initially zero. Simplification set additionally 38 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:29,226 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:43:29,228 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:43:29,228 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:43:29,228 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2020-10-20 06:43:29,359 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2020-10-20 06:43:29,361 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:43:29,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:29,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:43:29,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:29,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:43:29,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:29,453 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 [2020-10-20 06:43:29,453 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-10-20 06:43:29,525 INFO L75 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. [2020-10-20 06:43:29,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:43:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:43:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-10-20 06:43:29,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-20 06:43:29,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:29,529 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:43:29,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:29,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:43:29,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:29,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:43:29,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:29,642 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 [2020-10-20 06:43:29,642 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-10-20 06:43:29,689 INFO L75 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. [2020-10-20 06:43:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:43:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:43:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-10-20 06:43:29,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-20 06:43:29,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:29,692 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:43:29,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:29,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:43:29,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:29,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:43:29,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:29,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 [2020-10-20 06:43:29,787 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-10-20 06:43:29,841 INFO L75 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. [2020-10-20 06:43:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:43:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:43:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-10-20 06:43:29,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-20 06:43:29,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:29,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2020-10-20 06:43:29,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:29,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2020-10-20 06:43:29,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:29,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2020-10-20 06:43:29,849 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:43:29,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2020-10-20 06:43:29,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:43:29,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:43:29,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:43:29,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:43:29,850 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:43:29,850 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:43:29,850 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:43:29,850 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:43:29,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:43:29,850 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:43:29,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:43:29,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:43:29 BoogieIcfgContainer [2020-10-20 06:43:29,857 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:43:29,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:43:29,857 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:43:29,857 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:43:29,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:43:09" (3/4) ... [2020-10-20 06:43:29,861 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:43:29,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:43:29,863 INFO L168 Benchmark]: Toolchain (without parser) took 21914.29 ms. Allocated memory was 44.0 MB in the beginning and 96.5 MB in the end (delta: 52.4 MB). Free memory was 23.6 MB in the beginning and 34.5 MB in the end (delta: -10.9 MB). Peak memory consumption was 41.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:29,864 INFO L168 Benchmark]: CDTParser took 1.27 ms. Allocated memory is still 32.5 MB. Free memory was 11.4 MB in the beginning and 11.3 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. [2020-10-20 06:43:29,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.29 ms. Allocated memory was 44.0 MB in the beginning and 46.1 MB in the end (delta: 2.1 MB). Free memory was 22.7 MB in the beginning and 26.9 MB in the end (delta: -4.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:29,865 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.24 ms. Allocated memory is still 46.1 MB. Free memory was 26.6 MB in the beginning and 24.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:29,866 INFO L168 Benchmark]: Boogie Preprocessor took 30.34 ms. Allocated memory is still 46.1 MB. Free memory was 24.4 MB in the beginning and 22.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:29,866 INFO L168 Benchmark]: RCFGBuilder took 466.84 ms. Allocated memory was 46.1 MB in the beginning and 46.7 MB in the end (delta: 524.3 kB). Free memory was 22.5 MB in the beginning and 22.1 MB in the end (delta: 430.5 kB). Peak memory consumption was 13.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:29,867 INFO L168 Benchmark]: BuchiAutomizer took 20698.22 ms. Allocated memory was 46.7 MB in the beginning and 96.5 MB in the end (delta: 49.8 MB). Free memory was 22.1 MB in the beginning and 35.7 MB in the end (delta: -13.6 MB). Peak memory consumption was 36.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:29,868 INFO L168 Benchmark]: Witness Printer took 4.40 ms. Allocated memory is still 96.5 MB. Free memory was 35.7 MB in the beginning and 34.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:29,872 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.27 ms. Allocated memory is still 32.5 MB. Free memory was 11.4 MB in the beginning and 11.3 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 647.29 ms. Allocated memory was 44.0 MB in the beginning and 46.1 MB in the end (delta: 2.1 MB). Free memory was 22.7 MB in the beginning and 26.9 MB in the end (delta: -4.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 58.24 ms. Allocated memory is still 46.1 MB. Free memory was 26.6 MB in the beginning and 24.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 30.34 ms. Allocated memory is still 46.1 MB. Free memory was 24.4 MB in the beginning and 22.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 466.84 ms. Allocated memory was 46.1 MB in the beginning and 46.7 MB in the end (delta: 524.3 kB). Free memory was 22.5 MB in the beginning and 22.1 MB in the end (delta: 430.5 kB). Peak memory consumption was 13.3 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 20698.22 ms. Allocated memory was 46.7 MB in the beginning and 96.5 MB in the end (delta: 49.8 MB). Free memory was 22.1 MB in the beginning and 35.7 MB in the end (delta: -13.6 MB). Peak memory consumption was 36.2 MB. Max. memory is 14.3 GB. * Witness Printer took 4.40 ms. Allocated memory is still 96.5 MB. Free memory was 35.7 MB in the beginning and 34.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 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[sc1] + -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 20.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 13.3s. Construction of modules took 5.5s. Büchi inclusion checks took 1.5s. 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, 177 SDslu, 94 SDs, 0 SdLazy, 143 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital274 mio100 ax100 hnf99 lsp107 ukn82 mio100 lsp33 div129 bol100 ite100 ukn100 eq166 hnf78 smp87 dnf1059 smp33 tf100 neg94 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...