./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncmp_diffterm_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/cstrncmp_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 d2afd5adf9edf057cef901a8351053c92468d919 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:39:39,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:39:39,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:39:39,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:39:39,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:39:39,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:39:39,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:39:39,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:39:39,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:39:39,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:39:39,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:39:39,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:39:39,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:39:39,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:39:39,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:39:39,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:39:39,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:39:39,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:39:39,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:39:39,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:39:39,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:39:39,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:39:39,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:39:39,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:39:39,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:39:39,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:39:39,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:39:39,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:39:39,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:39:39,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:39:39,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:39:39,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:39:39,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:39:39,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:39:39,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:39:39,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:39:39,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:39:39,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:39:39,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:39:39,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:39:39,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:39:39,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:39:39,926 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:39:39,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:39:39,930 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:39:39,930 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:39:39,931 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:39:39,931 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:39:39,931 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:39:39,931 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:39:39,931 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:39:39,931 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:39:39,932 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:39:39,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:39:39,932 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:39:39,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:39:39,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:39:39,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:39:39,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:39:39,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:39:39,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:39:39,935 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:39:39,936 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:39:39,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:39:39,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:39:39,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:39:39,937 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:39:39,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:39:39,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:39:39,938 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:39:39,939 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:39:39,940 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:39:39,941 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 -> d2afd5adf9edf057cef901a8351053c92468d919 [2020-07-29 01:39:40,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:39:40,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:39:40,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:39:40,335 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:39:40,338 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:39:40,339 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncmp_diffterm_alloca.i [2020-07-29 01:39:40,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4362b7770/830c85db083940a58b9b568aeb5fd3a3/FLAG80c16ff1a [2020-07-29 01:39:41,000 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:39:41,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncmp_diffterm_alloca.i [2020-07-29 01:39:41,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4362b7770/830c85db083940a58b9b568aeb5fd3a3/FLAG80c16ff1a [2020-07-29 01:39:41,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4362b7770/830c85db083940a58b9b568aeb5fd3a3 [2020-07-29 01:39:41,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:39:41,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:39:41,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:41,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:39:41,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:39:41,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:41" (1/1) ... [2020-07-29 01:39:41,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e2c6c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:41, skipping insertion in model container [2020-07-29 01:39:41,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:41" (1/1) ... [2020-07-29 01:39:41,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:39:41,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:39:41,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:41,853 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:39:41,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:41,994 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:39:41,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:41 WrapperNode [2020-07-29 01:39:41,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:41,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:41,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:39:41,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:39:42,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:41" (1/1) ... [2020-07-29 01:39:42,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:41" (1/1) ... [2020-07-29 01:39:42,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:42,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:39:42,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:39:42,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:39:42,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:41" (1/1) ... [2020-07-29 01:39:42,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:41" (1/1) ... [2020-07-29 01:39:42,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:41" (1/1) ... [2020-07-29 01:39:42,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:41" (1/1) ... [2020-07-29 01:39:42,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:41" (1/1) ... [2020-07-29 01:39:42,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:41" (1/1) ... [2020-07-29 01:39:42,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:41" (1/1) ... [2020-07-29 01:39:42,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:39:42,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:39:42,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:39:42,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:39:42,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:41" (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-07-29 01:39:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:39:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:39:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:39:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:39:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:39:42,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:39:42,634 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:39:42,634 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:39:42,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:42 BoogieIcfgContainer [2020-07-29 01:39:42,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:39:42,642 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:39:42,642 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:39:42,646 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:39:42,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:42,647 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:39:41" (1/3) ... [2020-07-29 01:39:42,649 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@708c6683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:42, skipping insertion in model container [2020-07-29 01:39:42,649 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:42,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:41" (2/3) ... [2020-07-29 01:39:42,650 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@708c6683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:42, skipping insertion in model container [2020-07-29 01:39:42,650 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:42,650 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:42" (3/3) ... [2020-07-29 01:39:42,652 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncmp_diffterm_alloca.i [2020-07-29 01:39:42,706 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:39:42,707 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:39:42,707 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:39:42,707 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:39:42,708 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:39:42,708 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:39:42,708 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:39:42,708 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:39:42,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:42,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:39:42,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:42,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:42,761 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:42,761 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:42,762 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:39:42,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:42,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:39:42,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:42,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:42,767 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:42,768 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:42,777 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~nondet216, main_#t~nondet217, main_#t~malloc218.base, main_#t~malloc218.offset, main_#t~malloc219.base, main_#t~malloc219.offset, main_#t~nondet220, main_#t~ret221, 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~nondet216;havoc main_#t~nondet216;main_~length2~0 := main_#t~nondet217;havoc main_#t~nondet217; 11#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc218.base, main_#t~malloc218.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc218.base, main_#t~malloc218.offset;call main_#t~malloc219.base, main_#t~malloc219.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc219.base, main_#t~malloc219.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);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet220;havoc cstrncmp_#res;havoc cstrncmp_#t~mem209, cstrncmp_#t~short210, cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset, cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset, cstrncmp_#t~post205, cstrncmp_#t~mem206, cstrncmp_#t~mem207, cstrncmp_#t~short208, cstrncmp_#t~mem213, cstrncmp_#t~mem214, cstrncmp_#t~ite215, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 20#L367true assume !(0 == cstrncmp_~n); 6#L369-5true [2020-07-29 01:39:42,778 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-5true cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 17#L369-1true assume cstrncmp_#t~short208;call cstrncmp_#t~mem206 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem207 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short208 := cstrncmp_#t~mem206 == cstrncmp_#t~mem207; 4#L369-3true assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~mem206;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~short208;havoc cstrncmp_#t~mem207;cstrncmp_#t~short210 := 0 == cstrncmp_~n; 14#L370true assume cstrncmp_#t~short210; 19#L370-2true assume !cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;havoc cstrncmp_#t~short210;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, 1 + cstrncmp_#t~post212.offset;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; 6#L369-5true [2020-07-29 01:39:42,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:42,785 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2020-07-29 01:39:42,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:42,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560726991] [2020-07-29 01:39:42,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:42,930 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:42,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:42,995 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:42,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:42,997 INFO L82 PathProgramCache]: Analyzing trace with hash 52587176, now seen corresponding path program 1 times [2020-07-29 01:39:42,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:42,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803591014] [2020-07-29 01:39:42,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:43,074 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; {24#true} is VALID [2020-07-29 01:39:43,075 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume cstrncmp_#t~short208;call cstrncmp_#t~mem206 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem207 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short208 := cstrncmp_#t~mem206 == cstrncmp_#t~mem207; {24#true} is VALID [2020-07-29 01:39:43,075 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~mem206;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~short208;havoc cstrncmp_#t~mem207;cstrncmp_#t~short210 := 0 == cstrncmp_~n; {24#true} is VALID [2020-07-29 01:39:43,077 INFO L280 TraceCheckUtils]: 3: Hoare triple {24#true} assume cstrncmp_#t~short210; {26#|ULTIMATE.start_cstrncmp_#t~short210|} is VALID [2020-07-29 01:39:43,078 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#|ULTIMATE.start_cstrncmp_#t~short210|} assume !cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;havoc cstrncmp_#t~short210;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, 1 + cstrncmp_#t~post212.offset;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; {25#false} is VALID [2020-07-29 01:39:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:43,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803591014] [2020-07-29 01:39:43,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:39:43,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:39:43,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837463374] [2020-07-29 01:39:43,089 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:39:43,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:43,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:39:43,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:39:43,107 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-07-29 01:39:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:43,189 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 01:39:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:39:43,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:43,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:43,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2020-07-29 01:39:43,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:39:43,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2020-07-29 01:39:43,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:39:43,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:39:43,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2020-07-29 01:39:43,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:43,216 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:39:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2020-07-29 01:39:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 01:39:43,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:43,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 01:39:43,246 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 01:39:43,248 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 01:39:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:43,250 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:39:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:39:43,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:43,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:43,252 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 14 transitions. [2020-07-29 01:39:43,253 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 14 transitions. [2020-07-29 01:39:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:43,254 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:39:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:39:43,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:43,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:43,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:43,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:39:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-07-29 01:39:43,259 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:39:43,259 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:39:43,259 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:39:43,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:39:43,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:39:43,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:43,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:43,261 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:43,261 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:43,262 INFO L794 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 46#L-1 havoc main_#res;havoc main_#t~nondet216, main_#t~nondet217, main_#t~malloc218.base, main_#t~malloc218.offset, main_#t~malloc219.base, main_#t~malloc219.offset, main_#t~nondet220, main_#t~ret221, 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~nondet216;havoc main_#t~nondet216;main_~length2~0 := main_#t~nondet217;havoc main_#t~nondet217; 47#L382 assume !(main_~length1~0 < 1); 50#L382-2 assume !(main_~length2~0 < 1); 55#L385-1 call main_#t~malloc218.base, main_#t~malloc218.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc218.base, main_#t~malloc218.offset;call main_#t~malloc219.base, main_#t~malloc219.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc219.base, main_#t~malloc219.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);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet220;havoc cstrncmp_#res;havoc cstrncmp_#t~mem209, cstrncmp_#t~short210, cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset, cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset, cstrncmp_#t~post205, cstrncmp_#t~mem206, cstrncmp_#t~mem207, cstrncmp_#t~short208, cstrncmp_#t~mem213, cstrncmp_#t~mem214, cstrncmp_#t~ite215, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 56#L367 assume !(0 == cstrncmp_~n); 53#L369-5 [2020-07-29 01:39:43,262 INFO L796 eck$LassoCheckResult]: Loop: 53#L369-5 cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 54#L369-1 assume cstrncmp_#t~short208;call cstrncmp_#t~mem206 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem207 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short208 := cstrncmp_#t~mem206 == cstrncmp_#t~mem207; 48#L369-3 assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~mem206;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~short208;havoc cstrncmp_#t~mem207;cstrncmp_#t~short210 := 0 == cstrncmp_~n; 49#L370 assume !cstrncmp_#t~short210;call cstrncmp_#t~mem209 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short210 := 49 == cstrncmp_#t~mem209; 52#L370-2 assume !cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;havoc cstrncmp_#t~short210;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, 1 + cstrncmp_#t~post212.offset;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; 53#L369-5 [2020-07-29 01:39:43,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:43,263 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 2 times [2020-07-29 01:39:43,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:43,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822654298] [2020-07-29 01:39:43,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:43,286 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:43,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:43,312 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:43,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:43,316 INFO L82 PathProgramCache]: Analyzing trace with hash 52587238, now seen corresponding path program 1 times [2020-07-29 01:39:43,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:43,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606294477] [2020-07-29 01:39:43,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:43,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:43,372 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:43,383 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:43,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:43,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2120298631, now seen corresponding path program 1 times [2020-07-29 01:39:43,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:43,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892179570] [2020-07-29 01:39:43,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:43,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:43,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:43,498 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:43,742 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-07-29 01:39:44,228 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2020-07-29 01:39:44,416 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-07-29 01:39:44,431 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:44,432 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:44,433 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:44,433 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:44,434 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:44,434 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:44,434 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:44,434 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:44,435 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_diffterm_alloca.i_Iteration2_Lasso [2020-07-29 01:39:44,435 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:44,435 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:44,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:44,937 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2020-07-29 01:39:45,152 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-07-29 01:39:45,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,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-07-29 01:39:45,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:45,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:46,473 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:46,479 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-07-29 01:39:46,486 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-07-29 01:39:46,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:46,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:46,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:46,489 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:39:46,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:46,493 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:39:46,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:46,504 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-07-29 01:39:46,554 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-07-29 01:39:46,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:46,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:46,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:46,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:46,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:46,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:46,578 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:46,608 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-07-29 01:39:46,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:46,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:46,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:46,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:46,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:46,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:46,626 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-07-29 01:39:46,655 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-07-29 01:39:46,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:46,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:46,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:46,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:46,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:46,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:46,666 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 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:46,699 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-07-29 01:39:46,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:46,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:46,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:46,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:46,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:46,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:46,736 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:46,785 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-07-29 01:39:46,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:46,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:46,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:46,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:46,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:46,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:46,800 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) [2020-07-29 01:39:46,841 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-07-29 01:39:46,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:46,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:46,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:46,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:46,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:46,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:46,880 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:47,148 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-07-29 01:39:47,148 INFO L444 ModelExtractionUtils]: 8 out of 40 variables were initially zero. Simplification set additionally 29 variables to zero. 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) [2020-07-29 01:39:47,161 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:47,165 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:47,165 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:47,166 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncmp_~s2.base)_1, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s2.base)_1 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2020-07-29 01:39:47,295 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2020-07-29 01:39:47,303 INFO L393 LassoCheck]: Loop: "cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0;" "assume cstrncmp_#t~short208;call cstrncmp_#t~mem206 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem207 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short208 := cstrncmp_#t~mem206 == cstrncmp_#t~mem207;" "assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~mem206;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~short208;havoc cstrncmp_#t~mem207;cstrncmp_#t~short210 := 0 == cstrncmp_~n;" "assume !cstrncmp_#t~short210;call cstrncmp_#t~mem209 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short210 := 49 == cstrncmp_#t~mem209;" "assume !cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;havoc cstrncmp_#t~short210;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, 1 + cstrncmp_#t~post212.offset;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset;" [2020-07-29 01:39:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:47,330 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:39:47,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:47,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-29 01:39:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:47,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:47,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {88#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {88#unseeded} is VALID [2020-07-29 01:39:47,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {88#unseeded} havoc main_#res;havoc main_#t~nondet216, main_#t~nondet217, main_#t~malloc218.base, main_#t~malloc218.offset, main_#t~malloc219.base, main_#t~malloc219.offset, main_#t~nondet220, main_#t~ret221, 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~nondet216;havoc main_#t~nondet216;main_~length2~0 := main_#t~nondet217;havoc main_#t~nondet217; {88#unseeded} is VALID [2020-07-29 01:39:47,449 INFO L280 TraceCheckUtils]: 2: Hoare triple {88#unseeded} assume !(main_~length1~0 < 1); {88#unseeded} is VALID [2020-07-29 01:39:47,449 INFO L280 TraceCheckUtils]: 3: Hoare triple {88#unseeded} assume !(main_~length2~0 < 1); {88#unseeded} is VALID [2020-07-29 01:39:47,452 INFO L280 TraceCheckUtils]: 4: Hoare triple {88#unseeded} call main_#t~malloc218.base, main_#t~malloc218.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc218.base, main_#t~malloc218.offset;call main_#t~malloc219.base, main_#t~malloc219.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc219.base, main_#t~malloc219.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);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet220;havoc cstrncmp_#res;havoc cstrncmp_#t~mem209, cstrncmp_#t~short210, cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset, cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset, cstrncmp_#t~post205, cstrncmp_#t~mem206, cstrncmp_#t~mem207, cstrncmp_#t~short208, cstrncmp_#t~mem213, cstrncmp_#t~mem214, cstrncmp_#t~ite215, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; {203#(and (= 0 ULTIMATE.start_cstrncmp_~s2.offset) (= 0 ULTIMATE.start_cstrncmp_~s1.offset) unseeded)} is VALID [2020-07-29 01:39:47,453 INFO L280 TraceCheckUtils]: 5: Hoare triple {203#(and (= 0 ULTIMATE.start_cstrncmp_~s2.offset) (= 0 ULTIMATE.start_cstrncmp_~s1.offset) unseeded)} assume !(0 == cstrncmp_~n); {182#(and (= ULTIMATE.start_cstrncmp_~s1.offset ULTIMATE.start_cstrncmp_~s2.offset) unseeded)} is VALID [2020-07-29 01:39:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:47,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:39:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:47,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:47,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {183#(and (= ULTIMATE.start_cstrncmp_~s1.offset ULTIMATE.start_cstrncmp_~s2.offset) (>= oldRank0 (+ (select |#length| ULTIMATE.start_cstrncmp_~s2.base) (* (- 1) ULTIMATE.start_cstrncmp_~s1.offset))))} cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; {183#(and (= ULTIMATE.start_cstrncmp_~s1.offset ULTIMATE.start_cstrncmp_~s2.offset) (>= oldRank0 (+ (select |#length| ULTIMATE.start_cstrncmp_~s2.base) (* (- 1) ULTIMATE.start_cstrncmp_~s1.offset))))} is VALID [2020-07-29 01:39:47,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {183#(and (= ULTIMATE.start_cstrncmp_~s1.offset ULTIMATE.start_cstrncmp_~s2.offset) (>= oldRank0 (+ (select |#length| ULTIMATE.start_cstrncmp_~s2.base) (* (- 1) ULTIMATE.start_cstrncmp_~s1.offset))))} assume cstrncmp_#t~short208;call cstrncmp_#t~mem206 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem207 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short208 := cstrncmp_#t~mem206 == cstrncmp_#t~mem207; {210#(and (= ULTIMATE.start_cstrncmp_~s1.offset ULTIMATE.start_cstrncmp_~s2.offset) (<= (select |#length| ULTIMATE.start_cstrncmp_~s2.base) (+ ULTIMATE.start_cstrncmp_~s1.offset oldRank0)) (<= (+ ULTIMATE.start_cstrncmp_~s2.offset 1) (select |#length| ULTIMATE.start_cstrncmp_~s2.base)))} is VALID [2020-07-29 01:39:47,536 INFO L280 TraceCheckUtils]: 2: Hoare triple {210#(and (= ULTIMATE.start_cstrncmp_~s1.offset ULTIMATE.start_cstrncmp_~s2.offset) (<= (select |#length| ULTIMATE.start_cstrncmp_~s2.base) (+ ULTIMATE.start_cstrncmp_~s1.offset oldRank0)) (<= (+ ULTIMATE.start_cstrncmp_~s2.offset 1) (select |#length| ULTIMATE.start_cstrncmp_~s2.base)))} assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~mem206;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~short208;havoc cstrncmp_#t~mem207;cstrncmp_#t~short210 := 0 == cstrncmp_~n; {210#(and (= ULTIMATE.start_cstrncmp_~s1.offset ULTIMATE.start_cstrncmp_~s2.offset) (<= (select |#length| ULTIMATE.start_cstrncmp_~s2.base) (+ ULTIMATE.start_cstrncmp_~s1.offset oldRank0)) (<= (+ ULTIMATE.start_cstrncmp_~s2.offset 1) (select |#length| ULTIMATE.start_cstrncmp_~s2.base)))} is VALID [2020-07-29 01:39:47,541 INFO L280 TraceCheckUtils]: 3: Hoare triple {210#(and (= ULTIMATE.start_cstrncmp_~s1.offset ULTIMATE.start_cstrncmp_~s2.offset) (<= (select |#length| ULTIMATE.start_cstrncmp_~s2.base) (+ ULTIMATE.start_cstrncmp_~s1.offset oldRank0)) (<= (+ ULTIMATE.start_cstrncmp_~s2.offset 1) (select |#length| ULTIMATE.start_cstrncmp_~s2.base)))} assume !cstrncmp_#t~short210;call cstrncmp_#t~mem209 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short210 := 49 == cstrncmp_#t~mem209; {210#(and (= ULTIMATE.start_cstrncmp_~s1.offset ULTIMATE.start_cstrncmp_~s2.offset) (<= (select |#length| ULTIMATE.start_cstrncmp_~s2.base) (+ ULTIMATE.start_cstrncmp_~s1.offset oldRank0)) (<= (+ ULTIMATE.start_cstrncmp_~s2.offset 1) (select |#length| ULTIMATE.start_cstrncmp_~s2.base)))} is VALID [2020-07-29 01:39:47,543 INFO L280 TraceCheckUtils]: 4: Hoare triple {210#(and (= ULTIMATE.start_cstrncmp_~s1.offset ULTIMATE.start_cstrncmp_~s2.offset) (<= (select |#length| ULTIMATE.start_cstrncmp_~s2.base) (+ ULTIMATE.start_cstrncmp_~s1.offset oldRank0)) (<= (+ ULTIMATE.start_cstrncmp_~s2.offset 1) (select |#length| ULTIMATE.start_cstrncmp_~s2.base)))} assume !cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;havoc cstrncmp_#t~short210;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, 1 + cstrncmp_#t~post212.offset;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; {185#(and (= ULTIMATE.start_cstrncmp_~s1.offset ULTIMATE.start_cstrncmp_~s2.offset) (or (and (> oldRank0 (+ (select |#length| ULTIMATE.start_cstrncmp_~s2.base) (* (- 1) ULTIMATE.start_cstrncmp_~s1.offset))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:39:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:47,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:39:47,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:47,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:39:47,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,574 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-07-29 01:39:47,575 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-07-29 01:39:47,736 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 25 states and 31 transitions. Complement of second has 7 states. [2020-07-29 01:39:47,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:39:47,740 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:47,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. cyclomatic complexity: 4 [2020-07-29 01:39:47,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:47,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:47,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:39:47,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:47,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:47,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:47,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-07-29 01:39:47,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:39:47,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:47,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:47,752 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 4 [2020-07-29 01:39:47,753 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:39:47,753 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:39:47,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:47,759 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:47,759 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 31 transitions. cyclomatic complexity: 8 [2020-07-29 01:39:47,761 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:39:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:39:47,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:39:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:39:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:39:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:39:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:39:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:39:47,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:39:47,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:39:47,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:39:47,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:39:47,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:39:47,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:39:47,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:39:47,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:39:47,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:39:47,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:39:47,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:39:47,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:39:47,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:39:47,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:39:47,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:39:47,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:39:47,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:39:47,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:39:47,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:39:47,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:39:47,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:39:47,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:39:47,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:39:47,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:39:47,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:39:47,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:39:47,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:39:47,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:39:47,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:39:47,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 5 letters. [2020-07-29 01:39:47,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 5 letters. [2020-07-29 01:39:47,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 5 letters. [2020-07-29 01:39:47,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:39:47,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:39:47,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:39:47,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:39:47,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:39:47,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:39:47,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:39:47,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:39:47,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:39:47,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 5 letters. [2020-07-29 01:39:47,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 5 letters. [2020-07-29 01:39:47,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 5 letters. [2020-07-29 01:39:47,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,783 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:39:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-07-29 01:39:47,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:39:47,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 5 letters. [2020-07-29 01:39:47,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:39:47,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:47,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. cyclomatic complexity: 8 [2020-07-29 01:39:47,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:39:47,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 22 states and 27 transitions. [2020-07-29 01:39:47,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:39:47,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:39:47,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2020-07-29 01:39:47,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:47,793 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-29 01:39:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2020-07-29 01:39:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-29 01:39:47,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:47,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 27 transitions. Second operand 21 states. [2020-07-29 01:39:47,796 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 27 transitions. Second operand 21 states. [2020-07-29 01:39:47,796 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 21 states. [2020-07-29 01:39:47,797 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:47,800 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2020-07-29 01:39:47,800 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-07-29 01:39:47,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:47,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:47,801 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states and 27 transitions. [2020-07-29 01:39:47,801 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states and 27 transitions. [2020-07-29 01:39:47,802 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:47,804 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-07-29 01:39:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2020-07-29 01:39:47,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:47,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:47,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:47,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 01:39:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2020-07-29 01:39:47,807 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-07-29 01:39:47,807 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-07-29 01:39:47,808 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:39:47,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2020-07-29 01:39:47,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:39:47,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:47,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:47,809 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:47,809 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:47,810 INFO L794 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 257#L-1 havoc main_#res;havoc main_#t~nondet216, main_#t~nondet217, main_#t~malloc218.base, main_#t~malloc218.offset, main_#t~malloc219.base, main_#t~malloc219.offset, main_#t~nondet220, main_#t~ret221, 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~nondet216;havoc main_#t~nondet216;main_~length2~0 := main_#t~nondet217;havoc main_#t~nondet217; 258#L382 assume !(main_~length1~0 < 1); 263#L382-2 assume !(main_~length2~0 < 1); 271#L385-1 call main_#t~malloc218.base, main_#t~malloc218.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc218.base, main_#t~malloc218.offset;call main_#t~malloc219.base, main_#t~malloc219.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc219.base, main_#t~malloc219.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);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet220;havoc cstrncmp_#res;havoc cstrncmp_#t~mem209, cstrncmp_#t~short210, cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset, cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset, cstrncmp_#t~post205, cstrncmp_#t~mem206, cstrncmp_#t~mem207, cstrncmp_#t~short208, cstrncmp_#t~mem213, cstrncmp_#t~mem214, cstrncmp_#t~ite215, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 274#L367 assume !(0 == cstrncmp_~n); 275#L369-5 cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 268#L369-1 [2020-07-29 01:39:47,810 INFO L796 eck$LassoCheckResult]: Loop: 268#L369-1 assume !cstrncmp_#t~short208; 259#L369-3 assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~mem206;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~short208;havoc cstrncmp_#t~mem207;cstrncmp_#t~short210 := 0 == cstrncmp_~n; 260#L370 assume !cstrncmp_#t~short210;call cstrncmp_#t~mem209 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short210 := 49 == cstrncmp_#t~mem209; 265#L370-2 assume !cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;havoc cstrncmp_#t~short210;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, 1 + cstrncmp_#t~post212.offset;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; 267#L369-5 cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 268#L369-1 [2020-07-29 01:39:47,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:47,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2020-07-29 01:39:47,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:47,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713363614] [2020-07-29 01:39:47,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:47,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:47,844 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:47,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:47,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:47,850 INFO L82 PathProgramCache]: Analyzing trace with hash 57448140, now seen corresponding path program 1 times [2020-07-29 01:39:47,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:47,850 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398903426] [2020-07-29 01:39:47,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:47,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {379#true} assume !cstrncmp_#t~short208; {381#(not |ULTIMATE.start_cstrncmp_#t~short208|)} is VALID [2020-07-29 01:39:47,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {381#(not |ULTIMATE.start_cstrncmp_#t~short208|)} assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~mem206;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~short208;havoc cstrncmp_#t~mem207;cstrncmp_#t~short210 := 0 == cstrncmp_~n; {380#false} is VALID [2020-07-29 01:39:47,889 INFO L280 TraceCheckUtils]: 2: Hoare triple {380#false} assume !cstrncmp_#t~short210;call cstrncmp_#t~mem209 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short210 := 49 == cstrncmp_#t~mem209; {380#false} is VALID [2020-07-29 01:39:47,889 INFO L280 TraceCheckUtils]: 3: Hoare triple {380#false} assume !cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;havoc cstrncmp_#t~short210;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, 1 + cstrncmp_#t~post212.offset;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; {380#false} is VALID [2020-07-29 01:39:47,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {380#false} cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; {380#false} is VALID [2020-07-29 01:39:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:47,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398903426] [2020-07-29 01:39:47,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:39:47,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:39:47,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286150035] [2020-07-29 01:39:47,892 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:39:47,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:47,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:39:47,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:39:47,894 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:39:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:47,937 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-07-29 01:39:47,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:39:47,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:47,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:47,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2020-07-29 01:39:47,950 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:47,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2020-07-29 01:39:47,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:39:47,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:39:47,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:39:47,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:47,951 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:47,951 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:47,951 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:47,951 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:39:47,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:39:47,952 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:47,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:47,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:39:47 BoogieIcfgContainer [2020-07-29 01:39:47,960 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:39:47,960 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:39:47,960 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:39:47,961 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:39:47,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:42" (3/4) ... [2020-07-29 01:39:47,964 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:39:47,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:39:47,967 INFO L168 Benchmark]: Toolchain (without parser) took 6662.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 193.5 MB). Free memory was 960.2 MB in the beginning and 796.9 MB in the end (delta: 163.3 MB). Peak memory consumption was 356.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:47,967 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:47,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -124.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:47,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:47,970 INFO L168 Benchmark]: Boogie Preprocessor took 33.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:47,971 INFO L168 Benchmark]: RCFGBuilder took 552.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:47,972 INFO L168 Benchmark]: BuchiAutomizer took 5318.01 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 796.9 MB in the end (delta: 255.7 MB). Peak memory consumption was 338.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:47,973 INFO L168 Benchmark]: Witness Printer took 4.42 ms. Allocated memory is still 1.2 GB. Free memory is still 796.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:47,978 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 688.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -124.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 552.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5318.01 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 796.9 MB in the end (delta: 255.7 MB). Peak memory consumption was 338.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.42 ms. Allocated memory is still 1.2 GB. Free memory is still 796.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * s1 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 13 SDslu, 40 SDs, 0 SdLazy, 18 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax100 hnf99 lsp87 ukn85 mio100 lsp43 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 2 VariablesLoop: 3 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...