./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrcspn_malloc.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/cstrcspn_malloc.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 9b8825911d7551a36ae924528ba18cf2d7bccc78 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:25,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:39:25,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:39:25,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:39:25,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:39:25,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:39:25,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:39:25,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:39:25,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:39:25,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:39:25,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:39:25,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:39:25,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:39:25,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:39:25,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:39:25,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:39:25,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:39:25,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:39:25,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:39:25,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:39:25,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:39:25,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:39:25,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:39:25,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:39:25,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:39:25,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:39:25,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:39:25,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:39:25,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:39:25,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:39:25,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:39:25,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:39:25,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:39:25,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:39:25,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:39:25,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:39:25,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:39:25,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:39:25,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:39:25,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:39:25,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:39:25,907 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:25,928 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:39:25,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:39:25,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:39:25,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:39:25,932 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:39:25,932 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:39:25,932 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:39:25,933 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:39:25,933 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:39:25,933 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:39:25,934 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:39:25,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:39:25,935 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:39:25,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:39:25,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:39:25,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:39:25,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:39:25,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:39:25,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:39:25,937 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:39:25,937 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:39:25,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:39:25,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:39:25,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:39:25,938 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:39:25,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:39:25,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:39:25,939 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:39:25,940 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:39:25,941 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:39:25,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 -> 9b8825911d7551a36ae924528ba18cf2d7bccc78 [2020-07-29 01:39:26,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:39:26,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:39:26,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:39:26,264 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:39:26,265 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:39:26,267 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcspn_malloc.i [2020-07-29 01:39:26,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a139e93f/ec79108bba194e56b936b241f37da216/FLAGb2d50af4e [2020-07-29 01:39:26,862 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:39:26,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_malloc.i [2020-07-29 01:39:26,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a139e93f/ec79108bba194e56b936b241f37da216/FLAGb2d50af4e [2020-07-29 01:39:27,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a139e93f/ec79108bba194e56b936b241f37da216 [2020-07-29 01:39:27,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:39:27,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:39:27,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:27,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:39:27,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:39:27,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:27" (1/1) ... [2020-07-29 01:39:27,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d70fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:27, skipping insertion in model container [2020-07-29 01:39:27,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:27" (1/1) ... [2020-07-29 01:39:27,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:39:27,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:39:27,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:27,651 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:39:27,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:27,794 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:39:27,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:27 WrapperNode [2020-07-29 01:39:27,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:27,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:27,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:39:27,796 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:39:27,804 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:27" (1/1) ... [2020-07-29 01:39:27,828 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:27" (1/1) ... [2020-07-29 01:39:27,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:27,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:39:27,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:39:27,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:39:27,873 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:27" (1/1) ... [2020-07-29 01:39:27,873 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:27" (1/1) ... [2020-07-29 01:39:27,876 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:27" (1/1) ... [2020-07-29 01:39:27,877 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:27" (1/1) ... [2020-07-29 01:39:27,890 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:27" (1/1) ... [2020-07-29 01:39:27,895 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:27" (1/1) ... [2020-07-29 01:39:27,896 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:27" (1/1) ... [2020-07-29 01:39:27,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:39:27,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:39:27,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:39:27,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:39:27,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:27" (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:27,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:39:27,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:39:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:39:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:39:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:39:27,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:39:28,418 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:39:28,419 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:39:28,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:28 BoogieIcfgContainer [2020-07-29 01:39:28,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:39:28,426 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:39:28,426 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:39:28,429 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:39:28,430 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:28,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:39:27" (1/3) ... [2020-07-29 01:39:28,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@527548a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:28, skipping insertion in model container [2020-07-29 01:39:28,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:28,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:27" (2/3) ... [2020-07-29 01:39:28,433 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@527548a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:28, skipping insertion in model container [2020-07-29 01:39:28,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:28,434 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:28" (3/3) ... [2020-07-29 01:39:28,436 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcspn_malloc.i [2020-07-29 01:39:28,490 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:39:28,492 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:39:28,492 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:39:28,492 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:39:28,493 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:39:28,493 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:39:28,493 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:39:28,494 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:39:28,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:28,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:28,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:28,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:28,547 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:28,547 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:28,548 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:39:28,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:28,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:28,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:28,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:28,552 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:28,552 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:28,559 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2020-07-29 01:39:28,559 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2020-07-29 01:39:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:28,565 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 01:39:28,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:28,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443566623] [2020-07-29 01:39:28,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:28,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:28,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:28,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:28,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:28,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2020-07-29 01:39:28,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:28,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519996997] [2020-07-29 01:39:28,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:28,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {24#true} is VALID [2020-07-29 01:39:28,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {24#true} is VALID [2020-07-29 01:39:28,805 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-29 01:39:28,805 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#false} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {25#false} is VALID [2020-07-29 01:39:28,805 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#false} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {25#false} is VALID [2020-07-29 01:39:28,806 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#false} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {25#false} is VALID [2020-07-29 01:39:28,808 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:28,809 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519996997] [2020-07-29 01:39:28,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:39:28,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:39:28,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778800684] [2020-07-29 01:39:28,816 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:39:28,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:28,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:39:28,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:39:28,834 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-07-29 01:39:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:28,868 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-29 01:39:28,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:39:28,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:39:28,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:28,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-07-29 01:39:28,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:28,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2020-07-29 01:39:28,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:39:28,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:39:28,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-07-29 01:39:28,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:28,897 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:28,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-07-29 01:39:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-29 01:39:28,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:28,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:28,926 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:28,927 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:28,930 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:39:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:28,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:28,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:28,932 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:39:28,932 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:39:28,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:28,934 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:39:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:28,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:28,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:28,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:28,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:39:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-07-29 01:39:28,939 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:28,939 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:28,939 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:39:28,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:28,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:28,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:28,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:28,942 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:28,942 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:28,942 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2020-07-29 01:39:28,943 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2020-07-29 01:39:28,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:28,943 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2020-07-29 01:39:28,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:28,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744006413] [2020-07-29 01:39:28,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:28,965 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:28,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:28,990 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:28,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:28,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2020-07-29 01:39:28,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:28,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265072562] [2020-07-29 01:39:28,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:29,010 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:29,023 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:29,028 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:29,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:29,029 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2020-07-29 01:39:29,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:29,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608929964] [2020-07-29 01:39:29,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:29,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:29,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:29,194 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:29,396 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-29 01:39:29,868 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2020-07-29 01:39:30,037 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-07-29 01:39:30,051 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:30,052 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:30,053 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:30,053 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:30,053 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:30,053 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:30,054 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:30,054 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:30,054 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_malloc.i_Iteration2_Lasso [2020-07-29 01:39:30,054 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:30,055 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:30,119 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:30,504 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2020-07-29 01:39:30,704 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2020-07-29 01:39:30,713 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:30,718 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:30,724 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:30,731 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:30,737 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:30,744 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:30,749 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:30,753 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:30,758 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:30,763 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:30,819 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:30,824 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:30,828 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:30,834 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:30,842 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:30,846 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:30,852 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:30,856 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:31,800 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2020-07-29 01:39:32,206 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2020-07-29 01:39:32,441 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:32,447 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:32,458 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:32,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:32,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:32,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:32,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:32,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:32,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:32,472 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:32,502 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:32,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:32,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:32,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:32,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:32,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:32,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:32,535 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:32,712 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-29 01:39:32,712 INFO L444 ModelExtractionUtils]: 16 out of 28 variables were initially zero. Simplification set additionally 9 variables to zero. 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:32,729 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:39:32,732 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:32,733 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:32,733 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1 Supporting invariants [] [2020-07-29 01:39:32,818 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2020-07-29 01:39:32,824 INFO L393 LassoCheck]: Loop: "call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);" "assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207;" "call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208;" "assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256);" "assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;" "call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);" "assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212;" "cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset;" [2020-07-29 01:39:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:32,842 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:39:32,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:32,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:32,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:32,912 INFO L280 TraceCheckUtils]: 0: Hoare triple {92#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {92#unseeded} is VALID [2020-07-29 01:39:32,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {92#unseeded} is VALID [2020-07-29 01:39:32,914 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#unseeded} assume !(main_~length1~0 < 1); {92#unseeded} is VALID [2020-07-29 01:39:32,915 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#unseeded} assume !(main_~length2~0 < 1); {92#unseeded} is VALID [2020-07-29 01:39:32,915 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; {92#unseeded} is VALID [2020-07-29 01:39:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:32,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:39:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:32,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:32,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrcspn_~sc1~0.offset) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)))} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {167#(and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:32,977 INFO L280 TraceCheckUtils]: 1: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)))} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {167#(and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:32,978 INFO L280 TraceCheckUtils]: 2: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {167#(and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:32,980 INFO L280 TraceCheckUtils]: 3: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)))} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {167#(and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:32,981 INFO L280 TraceCheckUtils]: 4: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)))} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {167#(and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:32,982 INFO L280 TraceCheckUtils]: 5: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)))} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {167#(and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:32,983 INFO L280 TraceCheckUtils]: 6: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)))} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {167#(and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:32,985 INFO L280 TraceCheckUtils]: 7: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ ULTIMATE.start_cstrcspn_~sc1~0.offset oldRank0)))} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {150#(or unseeded (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrcspn_~sc1~0.offset) (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base))) (>= oldRank0 0)))} is VALID [2020-07-29 01:39:32,985 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:32,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:33,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:33,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:33,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,008 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:39:33,008 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:39:33,097 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2020-07-29 01:39:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:39:33,098 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:33,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:39:33,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:33,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:33,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:33,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:33,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:33,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:33,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:39:33,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:33,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:33,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:33,108 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:39:33,110 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:39:33,111 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:33,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:33,113 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:33,113 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:33,114 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:33,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:33,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:33,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:33,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:33,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:33,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:33,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:33,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:33,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:33,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:33,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:33,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:33,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:33,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:33,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:33,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:33,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:33,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:33,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:39:33,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:39:33,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:39:33,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:33,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:33,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:33,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:33,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:33,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:33,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:33,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:33,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:33,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:39:33,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:39:33,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:39:33,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:33,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:33,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:33,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:39:33,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:39:33,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:39:33,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:33,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:33,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:33,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:33,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:33,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:33,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:33,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:33,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:33,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:33,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:33,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:33,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:33,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:33,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:33,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,144 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-07-29 01:39:33,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:33,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:39:33,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2020-07-29 01:39:33,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:33,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:33,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:33,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2020-07-29 01:39:33,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:39:33,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:39:33,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-07-29 01:39:33,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:33,153 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-07-29 01:39:33,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-29 01:39:33,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:33,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:33,155 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:33,156 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:33,156 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:33,159 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:39:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:33,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:33,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:33,161 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states and 25 transitions. [2020-07-29 01:39:33,161 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states and 25 transitions. [2020-07-29 01:39:33,162 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:33,164 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:39:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:33,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:33,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:33,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:33,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:39:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-07-29 01:39:33,167 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:33,167 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:33,167 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:39:33,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:33,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:33,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:33,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:33,169 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:33,169 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:33,169 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 224#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 225#L382 assume !(main_~length1~0 < 1); 226#L382-2 assume !(main_~length2~0 < 1); 223#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 220#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 222#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 232#L372-5 [2020-07-29 01:39:33,170 INFO L796 eck$LassoCheckResult]: Loop: 232#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 227#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 228#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 232#L372-5 [2020-07-29 01:39:33,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:33,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2020-07-29 01:39:33,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:33,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986357241] [2020-07-29 01:39:33,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:33,189 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:33,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:33,244 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:33,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:33,245 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2020-07-29 01:39:33,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:33,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098971749] [2020-07-29 01:39:33,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:33,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:33,257 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:33,259 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:33,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:33,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2020-07-29 01:39:33,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:33,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489023943] [2020-07-29 01:39:33,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:33,282 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:33,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:33,311 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:33,849 WARN L193 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2020-07-29 01:39:34,025 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-07-29 01:39:34,028 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:34,029 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:34,029 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:34,029 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:34,029 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:34,029 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:34,029 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:34,029 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:34,029 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_malloc.i_Iteration3_Lasso [2020-07-29 01:39:34,029 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:34,029 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:34,066 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:34,073 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:34,078 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:34,083 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:34,087 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:34,440 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-07-29 01:39:34,557 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:34,560 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:34,564 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:34,569 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:34,572 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:34,575 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:34,578 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:34,581 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:34,584 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:34,588 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:34,591 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:34,594 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:34,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:34,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:35,687 WARN L193 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2020-07-29 01:39:36,113 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-07-29 01:39:36,242 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:36,243 INFO L489 LassoAnalysis]: Using template 'affine'. 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:36,246 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:36,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:36,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:36,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:36,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:36,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:36,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:36,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:36,249 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) [2020-07-29 01:39:36,275 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:36,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:36,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:36,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:36,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:36,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:36,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:36,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:36,283 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:36,308 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:36,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:36,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:36,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:36,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:36,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:36,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:36,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:36,343 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:36,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:36,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:36,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:36,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:36,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:36,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:36,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:36,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:36,371 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:36,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:36,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:36,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:36,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:36,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:36,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:36,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:36,416 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:36,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:36,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:36,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:36,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:36,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:36,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:36,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:36,465 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:36,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:36,469 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-07-29 01:39:36,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:36,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:36,490 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-07-29 01:39:36,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:36,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:36,534 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:36,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:36,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:36,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:36,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:36,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:36,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:36,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:36,566 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:36,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:36,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:36,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:36,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:36,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:36,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:36,605 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:36,662 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-07-29 01:39:36,663 INFO L444 ModelExtractionUtils]: 14 out of 49 variables were initially zero. Simplification set additionally 32 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:36,674 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:36,678 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:36,678 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:36,678 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2020-07-29 01:39:36,762 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2020-07-29 01:39:36,768 INFO L393 LassoCheck]: Loop: "call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208;" "assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256);" "assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset;" [2020-07-29 01:39:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:36,774 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:39:36,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:36,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:39:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:36,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:36,848 INFO L280 TraceCheckUtils]: 0: Hoare triple {323#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {323#unseeded} is VALID [2020-07-29 01:39:36,850 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {323#unseeded} is VALID [2020-07-29 01:39:36,857 INFO L280 TraceCheckUtils]: 2: Hoare triple {323#unseeded} assume !(main_~length1~0 < 1); {323#unseeded} is VALID [2020-07-29 01:39:36,859 INFO L280 TraceCheckUtils]: 3: Hoare triple {323#unseeded} assume !(main_~length2~0 < 1); {323#unseeded} is VALID [2020-07-29 01:39:36,861 INFO L280 TraceCheckUtils]: 4: Hoare triple {323#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; {423#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:36,862 INFO L280 TraceCheckUtils]: 5: Hoare triple {423#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {423#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:39:36,863 INFO L280 TraceCheckUtils]: 6: Hoare triple {423#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {402#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) unseeded)} is VALID [2020-07-29 01:39:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:36,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:39:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:36,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:36,908 INFO L280 TraceCheckUtils]: 0: Hoare triple {403#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* (- 1) ULTIMATE.start_cstrcspn_~s~0.offset))) (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {430#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:36,910 INFO L280 TraceCheckUtils]: 1: Hoare triple {430#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {430#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:39:36,911 INFO L280 TraceCheckUtils]: 2: Hoare triple {430#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; {405#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* (- 1) ULTIMATE.start_cstrcspn_~s~0.offset)))) unseeded) (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:39:36,912 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:36,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:39:36,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:36,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:36,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:36,928 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:36,928 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:39:37,040 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2020-07-29 01:39:37,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:39:37,040 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:37,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:37,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:37,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:37,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:39:37,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:37,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:37,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:37,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2020-07-29 01:39:37,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:37,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:37,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:37,045 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:37,046 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:37,046 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:39:37,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:37,048 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:37,048 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2020-07-29 01:39:37,049 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:37,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:37,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:37,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:37,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:37,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:37,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:37,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:37,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:37,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:37,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:39:37,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:39:37,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:39:37,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:37,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:37,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:37,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:37,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:37,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:37,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:37,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:37,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:37,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:37,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:37,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:37,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:37,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:37,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:37,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:37,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:37,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:37,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:37,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:37,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:39:37,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:37,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:37,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:39:37,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:37,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:37,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:37,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,063 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:39:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:39:37,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:37,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:39:37,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:39:37,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:37,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2020-07-29 01:39:37,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:37,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2020-07-29 01:39:37,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:39:37,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:39:37,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2020-07-29 01:39:37,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:37,071 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-07-29 01:39:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2020-07-29 01:39:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2020-07-29 01:39:37,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:37,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:39:37,074 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:39:37,074 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:39:37,075 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:37,077 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:39:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:39:37,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:37,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:37,078 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 30 states and 40 transitions. [2020-07-29 01:39:37,079 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 30 states and 40 transitions. [2020-07-29 01:39:37,079 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:37,082 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:39:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:39:37,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:37,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:37,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:37,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:39:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-07-29 01:39:37,085 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:39:37,085 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:39:37,085 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:39:37,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-07-29 01:39:37,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:37,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:37,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:37,087 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:37,087 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:37,087 INFO L794 eck$LassoCheckResult]: Stem: 506#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 499#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 500#L382 assume !(main_~length1~0 < 1); 501#L382-2 assume !(main_~length2~0 < 1); 498#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 494#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 495#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 508#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 504#L372-1 assume !cstrcspn_#t~short210; 505#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 490#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 491#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 492#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 493#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 497#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 507#L372-5 [2020-07-29 01:39:37,087 INFO L796 eck$LassoCheckResult]: Loop: 507#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 502#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 503#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 507#L372-5 [2020-07-29 01:39:37,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:37,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2020-07-29 01:39:37,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:37,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212743278] [2020-07-29 01:39:37,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:37,105 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:37,121 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:37,127 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:37,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:37,127 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2020-07-29 01:39:37,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:37,128 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662048982] [2020-07-29 01:39:37,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:37,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:37,137 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:37,139 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:37,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:37,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2020-07-29 01:39:37,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:37,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915057780] [2020-07-29 01:39:37,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:37,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {642#true} is VALID [2020-07-29 01:39:37,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {642#true} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {642#true} is VALID [2020-07-29 01:39:37,260 INFO L280 TraceCheckUtils]: 2: Hoare triple {642#true} assume !(main_~length1~0 < 1); {642#true} is VALID [2020-07-29 01:39:37,260 INFO L280 TraceCheckUtils]: 3: Hoare triple {642#true} assume !(main_~length2~0 < 1); {642#true} is VALID [2020-07-29 01:39:37,261 INFO L280 TraceCheckUtils]: 4: Hoare triple {642#true} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; {642#true} is VALID [2020-07-29 01:39:37,261 INFO L280 TraceCheckUtils]: 5: Hoare triple {642#true} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {642#true} is VALID [2020-07-29 01:39:37,262 INFO L280 TraceCheckUtils]: 6: Hoare triple {642#true} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {644#(and (= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base))} is VALID [2020-07-29 01:39:37,263 INFO L280 TraceCheckUtils]: 7: Hoare triple {644#(and (= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {645#(or (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0) |ULTIMATE.start_cstrcspn_#t~short210|)} is VALID [2020-07-29 01:39:37,264 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#(or (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0) |ULTIMATE.start_cstrcspn_#t~short210|)} assume !cstrcspn_#t~short210; {646#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:37,265 INFO L280 TraceCheckUtils]: 9: Hoare triple {646#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {646#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:37,265 INFO L280 TraceCheckUtils]: 10: Hoare triple {646#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {646#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:37,266 INFO L280 TraceCheckUtils]: 11: Hoare triple {646#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {646#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:37,267 INFO L280 TraceCheckUtils]: 12: Hoare triple {646#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {646#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:37,267 INFO L280 TraceCheckUtils]: 13: Hoare triple {646#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {646#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} is VALID [2020-07-29 01:39:37,268 INFO L280 TraceCheckUtils]: 14: Hoare triple {646#(= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s2.offset) 0)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {647#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) ULTIMATE.start_cstrcspn_~s~0.offset))} is VALID [2020-07-29 01:39:37,269 INFO L280 TraceCheckUtils]: 15: Hoare triple {647#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) ULTIMATE.start_cstrcspn_~s~0.offset))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {648#(not |ULTIMATE.start_cstrcspn_#t~short210|)} is VALID [2020-07-29 01:39:37,270 INFO L280 TraceCheckUtils]: 16: Hoare triple {648#(not |ULTIMATE.start_cstrcspn_#t~short210|)} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {643#false} is VALID [2020-07-29 01:39:37,270 INFO L280 TraceCheckUtils]: 17: Hoare triple {643#false} assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; {643#false} is VALID [2020-07-29 01:39:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:37,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915057780] [2020-07-29 01:39:37,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404016899] [2020-07-29 01:39:37,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:39:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:37,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-29 01:39:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:37,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:37,605 INFO L350 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2020-07-29 01:39:37,606 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2020-07-29 01:39:37,607 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:39:37,621 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:39:37,633 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-07-29 01:39:37,633 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:43, output treesize:27 [2020-07-29 01:39:37,640 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:39:37,640 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_63|, |ULTIMATE.start_cstrcspn_#in~s1.base|, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_~nondetString2~0.offset]. (and (= (let ((.cse0 (store |v_#memory_int_63| |ULTIMATE.start_cstrcspn_#in~s1.base| (store (select |v_#memory_int_63| |ULTIMATE.start_cstrcspn_#in~s1.base|) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1)) 0)))) (store .cse0 ULTIMATE.start_cstrcspn_~s2.base (store (select .cse0 ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0))) |#memory_int|) (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= ULTIMATE.start_main_~nondetString2~0.offset 0)) [2020-07-29 01:39:37,640 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|ULTIMATE.start_cstrcspn_#in~s1.base|, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_~length2~0]. (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= 0 (select (select |#memory_int| |ULTIMATE.start_cstrcspn_#in~s1.base|) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1)))) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0)) [2020-07-29 01:39:37,886 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:39:38,903 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:39:39,190 INFO L280 TraceCheckUtils]: 0: Hoare triple {642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {642#true} is VALID [2020-07-29 01:39:39,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {642#true} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {642#true} is VALID [2020-07-29 01:39:39,190 INFO L280 TraceCheckUtils]: 2: Hoare triple {642#true} assume !(main_~length1~0 < 1); {642#true} is VALID [2020-07-29 01:39:39,191 INFO L280 TraceCheckUtils]: 3: Hoare triple {642#true} assume !(main_~length2~0 < 1); {642#true} is VALID [2020-07-29 01:39:39,194 INFO L280 TraceCheckUtils]: 4: Hoare triple {642#true} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; {664#(exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0)))} is VALID [2020-07-29 01:39:39,197 INFO L280 TraceCheckUtils]: 5: Hoare triple {664#(exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0)))} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {664#(exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0)))} is VALID [2020-07-29 01:39:39,198 INFO L280 TraceCheckUtils]: 6: Hoare triple {664#(exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0)))} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {671#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base))} is VALID [2020-07-29 01:39:39,200 INFO L280 TraceCheckUtils]: 7: Hoare triple {671#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset) (= ULTIMATE.start_cstrcspn_~s~0.base ULTIMATE.start_cstrcspn_~s2.base))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {675#(or (and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset)) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))) (not |ULTIMATE.start_cstrcspn_#t~short210|)) (and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset))) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))) |ULTIMATE.start_cstrcspn_#t~short210|))} is VALID [2020-07-29 01:39:39,201 INFO L280 TraceCheckUtils]: 8: Hoare triple {675#(or (and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset)) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))) (not |ULTIMATE.start_cstrcspn_#t~short210|)) (and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset))) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))) |ULTIMATE.start_cstrcspn_#t~short210|))} assume !cstrcspn_#t~short210; {679#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset)) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))))} is VALID [2020-07-29 01:39:39,202 INFO L280 TraceCheckUtils]: 9: Hoare triple {679#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset)) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))))} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {679#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset)) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))))} is VALID [2020-07-29 01:39:39,204 INFO L280 TraceCheckUtils]: 10: Hoare triple {679#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset)) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))))} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {679#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset)) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))))} is VALID [2020-07-29 01:39:39,204 INFO L280 TraceCheckUtils]: 11: Hoare triple {679#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset)) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))))} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {679#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset)) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))))} is VALID [2020-07-29 01:39:39,205 INFO L280 TraceCheckUtils]: 12: Hoare triple {679#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset)) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))))} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {679#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset)) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))))} is VALID [2020-07-29 01:39:39,206 INFO L280 TraceCheckUtils]: 13: Hoare triple {679#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset)) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))))} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {679#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset)) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))))} is VALID [2020-07-29 01:39:39,215 INFO L280 TraceCheckUtils]: 14: Hoare triple {679#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) (exists ((ULTIMATE.start_cstrcspn_~s~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) ULTIMATE.start_cstrcspn_~s~0.offset)) (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_cstrcspn_~s2.offset))))} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {698#(exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) v_prenex_1)) (<= v_prenex_1 ULTIMATE.start_main_~nondetString2~0.offset) (<= 0 v_prenex_1) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))))))} is VALID [2020-07-29 01:39:39,216 INFO L280 TraceCheckUtils]: 15: Hoare triple {698#(exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) v_prenex_1)) (<= v_prenex_1 ULTIMATE.start_main_~nondetString2~0.offset) (<= 0 v_prenex_1) (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))))))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {648#(not |ULTIMATE.start_cstrcspn_#t~short210|)} is VALID [2020-07-29 01:39:39,217 INFO L280 TraceCheckUtils]: 16: Hoare triple {648#(not |ULTIMATE.start_cstrcspn_#t~short210|)} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {643#false} is VALID [2020-07-29 01:39:39,217 INFO L280 TraceCheckUtils]: 17: Hoare triple {643#false} assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; {643#false} is VALID [2020-07-29 01:39:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:39,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:39:39,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2020-07-29 01:39:39,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877057375] [2020-07-29 01:39:39,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:39,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:39:39,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:39:39,333 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 12 states. [2020-07-29 01:39:41,299 WARN L193 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2020-07-29 01:40:00,276 WARN L193 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2020-07-29 01:40:00,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:40:00,291 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2020-07-29 01:40:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:40:00,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:40:12,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:12,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2020-07-29 01:40:12,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:12,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2020-07-29 01:40:12,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:40:12,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:40:12,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2020-07-29 01:40:12,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:40:12,381 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2020-07-29 01:40:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2020-07-29 01:40:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2020-07-29 01:40:12,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:12,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 53 transitions. Second operand 28 states. [2020-07-29 01:40:12,385 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 53 transitions. Second operand 28 states. [2020-07-29 01:40:12,385 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 28 states. [2020-07-29 01:40:12,386 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:12,388 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2020-07-29 01:40:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2020-07-29 01:40:12,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:12,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:12,389 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 43 states and 53 transitions. [2020-07-29 01:40:12,389 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 43 states and 53 transitions. [2020-07-29 01:40:12,390 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:12,393 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2020-07-29 01:40:12,393 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2020-07-29 01:40:12,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:12,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:12,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:12,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 01:40:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-07-29 01:40:12,396 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-07-29 01:40:12,396 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-07-29 01:40:12,396 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:40:12,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2020-07-29 01:40:12,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:12,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:12,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:12,398 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:12,398 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:40:12,398 INFO L794 eck$LassoCheckResult]: Stem: 791#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 788#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 789#L382 assume !(main_~length1~0 < 1); 790#L382-2 assume !(main_~length2~0 < 1); 787#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 783#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 784#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 803#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 794#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 795#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 779#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 780#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 781#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 782#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 786#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 796#L372-5 [2020-07-29 01:40:12,398 INFO L796 eck$LassoCheckResult]: Loop: 796#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 792#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 793#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 796#L372-5 [2020-07-29 01:40:12,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:12,399 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2020-07-29 01:40:12,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:12,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836257766] [2020-07-29 01:40:12,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:12,434 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:12,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:12,458 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:12,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:12,459 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2020-07-29 01:40:12,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:12,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755337321] [2020-07-29 01:40:12,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:12,465 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:12,468 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:12,470 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:12,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:12,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2020-07-29 01:40:12,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:12,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849021612] [2020-07-29 01:40:12,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:12,492 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:12,512 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:12,518 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:13,328 WARN L193 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 138 [2020-07-29 01:40:13,588 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-07-29 01:40:13,593 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:40:13,593 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:40:13,594 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:40:13,594 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:40:13,594 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:40:13,594 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:13,594 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:40:13,594 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:40:13,594 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_malloc.i_Iteration5_Lasso [2020-07-29 01:40:13,594 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:40:13,594 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:40:13,630 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:40:13,633 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:40:13,637 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:40:13,640 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:40:13,643 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:40:13,646 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:40:13,655 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:40:13,658 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:40:14,799 WARN L193 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2020-07-29 01:40:14,944 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-29 01:40:14,950 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:40:14,954 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:40:14,970 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:40:14,974 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:40:14,977 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:40:14,981 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:40:14,985 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:40:14,988 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:40:14,991 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:40:14,994 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:40:14,997 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:40:15,623 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2020-07-29 01:40:16,358 WARN L193 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2020-07-29 01:40:17,068 WARN L193 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2020-07-29 01:40:17,285 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-07-29 01:40:17,405 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:40:17,406 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:17,409 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:40:17,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:17,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:17,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:17,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:17,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:17,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:17,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:17,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:17,437 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:40:17,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:17,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:17,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:17,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:17,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:17,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:17,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:17,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:17,463 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:40:17,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:17,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:17,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:17,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:17,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:17,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:17,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:17,472 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:17,496 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:40:17,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:17,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:17,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:17,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:17,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:17,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:17,501 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 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:17,525 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:40:17,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:17,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:17,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:17,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:17,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:17,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:17,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:17,529 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:17,553 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:40:17,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:17,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:17,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:17,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:17,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:17,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:17,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:17,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:17,579 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:40:17,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:17,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:17,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:17,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:17,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:17,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:17,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:17,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:17,607 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 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:17,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:17,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:17,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:17,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:17,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:17,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:17,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:17,660 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:40:17,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:17,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:17,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:17,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:17,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:17,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:17,683 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:40:17,706 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 01:40:17,706 INFO L444 ModelExtractionUtils]: 16 out of 34 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:17,708 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:40:17,710 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:40:17,710 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:40:17,710 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3) = -1*ULTIMATE.start_cstrcspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 Supporting invariants [] [2020-07-29 01:40:17,838 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-07-29 01:40:17,844 INFO L393 LassoCheck]: Loop: "call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208;" "assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256);" "assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset;" [2020-07-29 01:40:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:17,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:40:17,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:17,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:40:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:17,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:17,936 INFO L280 TraceCheckUtils]: 0: Hoare triple {976#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {976#unseeded} is VALID [2020-07-29 01:40:17,937 INFO L280 TraceCheckUtils]: 1: Hoare triple {976#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {976#unseeded} is VALID [2020-07-29 01:40:17,946 INFO L280 TraceCheckUtils]: 2: Hoare triple {976#unseeded} assume !(main_~length1~0 < 1); {976#unseeded} is VALID [2020-07-29 01:40:17,946 INFO L280 TraceCheckUtils]: 3: Hoare triple {976#unseeded} assume !(main_~length2~0 < 1); {976#unseeded} is VALID [2020-07-29 01:40:17,948 INFO L280 TraceCheckUtils]: 4: Hoare triple {976#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:17,949 INFO L280 TraceCheckUtils]: 5: Hoare triple {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:17,950 INFO L280 TraceCheckUtils]: 6: Hoare triple {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:17,951 INFO L280 TraceCheckUtils]: 7: Hoare triple {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:17,952 INFO L280 TraceCheckUtils]: 8: Hoare triple {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:17,953 INFO L280 TraceCheckUtils]: 9: Hoare triple {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:17,954 INFO L280 TraceCheckUtils]: 10: Hoare triple {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:17,954 INFO L280 TraceCheckUtils]: 11: Hoare triple {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:17,955 INFO L280 TraceCheckUtils]: 12: Hoare triple {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:17,958 INFO L280 TraceCheckUtils]: 13: Hoare triple {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:17,959 INFO L280 TraceCheckUtils]: 14: Hoare triple {1131#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {1110#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) unseeded)} is VALID [2020-07-29 01:40:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:17,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:40:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:17,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:17,998 INFO L280 TraceCheckUtils]: 0: Hoare triple {1111#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|))) (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {1162#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:40:17,999 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {1162#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:40:18,000 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; {1113#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)))) unseeded) (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:18,001 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:40:18,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:40:18,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:18,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,020 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:40:18,020 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:40:18,120 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2020-07-29 01:40:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:40:18,120 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:18,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:18,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:18,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:18,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:40:18,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:18,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:18,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:18,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2020-07-29 01:40:18,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:18,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:18,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:18,124 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:18,125 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:18,126 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:40:18,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:18,126 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:18,127 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 58 transitions. cyclomatic complexity: 15 [2020-07-29 01:40:18,127 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:18,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:40:18,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:40:18,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:40:18,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:40:18,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:40:18,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:40:18,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:18,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:18,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:18,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,138 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:40:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:40:18,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,140 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:40:18,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:18,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:40:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:18,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:18,229 INFO L280 TraceCheckUtils]: 0: Hoare triple {976#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {976#unseeded} is VALID [2020-07-29 01:40:18,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {976#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {976#unseeded} is VALID [2020-07-29 01:40:18,231 INFO L280 TraceCheckUtils]: 2: Hoare triple {976#unseeded} assume !(main_~length1~0 < 1); {976#unseeded} is VALID [2020-07-29 01:40:18,232 INFO L280 TraceCheckUtils]: 3: Hoare triple {976#unseeded} assume !(main_~length2~0 < 1); {976#unseeded} is VALID [2020-07-29 01:40:18,234 INFO L280 TraceCheckUtils]: 4: Hoare triple {976#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,235 INFO L280 TraceCheckUtils]: 5: Hoare triple {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,236 INFO L280 TraceCheckUtils]: 6: Hoare triple {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,237 INFO L280 TraceCheckUtils]: 7: Hoare triple {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,238 INFO L280 TraceCheckUtils]: 8: Hoare triple {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,239 INFO L280 TraceCheckUtils]: 9: Hoare triple {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,240 INFO L280 TraceCheckUtils]: 10: Hoare triple {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,241 INFO L280 TraceCheckUtils]: 11: Hoare triple {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,241 INFO L280 TraceCheckUtils]: 12: Hoare triple {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,242 INFO L280 TraceCheckUtils]: 13: Hoare triple {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,243 INFO L280 TraceCheckUtils]: 14: Hoare triple {1242#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {1110#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) unseeded)} is VALID [2020-07-29 01:40:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:18,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:40:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:18,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:18,283 INFO L280 TraceCheckUtils]: 0: Hoare triple {1111#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|))) (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {1273#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:40:18,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {1273#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {1273#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:40:18,286 INFO L280 TraceCheckUtils]: 2: Hoare triple {1273#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; {1113#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)))) unseeded) (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:18,286 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:40:18,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:40:18,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:18,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,305 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:40:18,305 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:40:18,387 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2020-07-29 01:40:18,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:40:18,387 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:18,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:18,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:18,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:18,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:40:18,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:18,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:18,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:18,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2020-07-29 01:40:18,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:18,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:18,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:18,391 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:18,391 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:18,391 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:40:18,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:18,392 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:18,392 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 58 transitions. cyclomatic complexity: 15 [2020-07-29 01:40:18,393 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:18,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:40:18,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:40:18,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:40:18,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:40:18,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:40:18,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:40:18,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:18,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:18,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:18,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,409 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:40:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:40:18,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,411 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:40:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:18,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:40:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:18,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:18,505 INFO L280 TraceCheckUtils]: 0: Hoare triple {976#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {976#unseeded} is VALID [2020-07-29 01:40:18,506 INFO L280 TraceCheckUtils]: 1: Hoare triple {976#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {976#unseeded} is VALID [2020-07-29 01:40:18,506 INFO L280 TraceCheckUtils]: 2: Hoare triple {976#unseeded} assume !(main_~length1~0 < 1); {976#unseeded} is VALID [2020-07-29 01:40:18,507 INFO L280 TraceCheckUtils]: 3: Hoare triple {976#unseeded} assume !(main_~length2~0 < 1); {976#unseeded} is VALID [2020-07-29 01:40:18,508 INFO L280 TraceCheckUtils]: 4: Hoare triple {976#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,509 INFO L280 TraceCheckUtils]: 5: Hoare triple {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,512 INFO L280 TraceCheckUtils]: 6: Hoare triple {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,515 INFO L280 TraceCheckUtils]: 7: Hoare triple {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,515 INFO L280 TraceCheckUtils]: 8: Hoare triple {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,516 INFO L280 TraceCheckUtils]: 9: Hoare triple {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,516 INFO L280 TraceCheckUtils]: 10: Hoare triple {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,517 INFO L280 TraceCheckUtils]: 11: Hoare triple {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,518 INFO L280 TraceCheckUtils]: 12: Hoare triple {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,519 INFO L280 TraceCheckUtils]: 13: Hoare triple {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} is VALID [2020-07-29 01:40:18,520 INFO L280 TraceCheckUtils]: 14: Hoare triple {1353#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrcspn_~s2.base) unseeded)} assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; {1110#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) unseeded)} is VALID [2020-07-29 01:40:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:18,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:40:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:18,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:18,562 INFO L280 TraceCheckUtils]: 0: Hoare triple {1111#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|))) (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; {1384#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:40:18,563 INFO L280 TraceCheckUtils]: 1: Hoare triple {1384#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); {1384#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} is VALID [2020-07-29 01:40:18,565 INFO L280 TraceCheckUtils]: 2: Hoare triple {1384#(and (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrcspn_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)))} assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; {1113#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrcspn_~s~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc216.base|)))) unseeded) (= ULTIMATE.start_cstrcspn_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:18,565 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:40:18,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:40:18,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:18,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,585 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:40:18,585 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:40:18,699 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 45 states and 60 transitions. Complement of second has 5 states. [2020-07-29 01:40:18,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:40:18,699 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:18,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:18,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:18,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:18,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:40:18,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:18,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:18,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:18,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 60 transitions. [2020-07-29 01:40:18,702 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:40:18,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:40:18,703 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:18,703 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:18,703 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:40:18,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:18,704 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:18,704 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2020-07-29 01:40:18,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2020-07-29 01:40:18,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:40:18,705 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:40:18,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:40:18,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:40:18,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:40:18,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:40:18,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:40:18,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:40:18,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:18,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:18,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:18,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:18,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:18,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:18,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,713 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:40:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-29 01:40:18,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:18,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:18,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2020-07-29 01:40:18,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:18,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2020-07-29 01:40:18,717 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:40:18,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2020-07-29 01:40:18,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:40:18,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:40:18,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:40:18,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:40:18,717 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:40:18,718 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:40:18,718 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:40:18,718 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:40:18,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:40:18,718 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:40:18,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:40:18,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:40:18 BoogieIcfgContainer [2020-07-29 01:40:18,724 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:40:18,724 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:40:18,724 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:40:18,724 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:40:18,725 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:28" (3/4) ... [2020-07-29 01:40:18,727 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:40:18,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:40:18,729 INFO L168 Benchmark]: Toolchain (without parser) took 51545.12 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 492.3 MB). Free memory was 961.6 MB in the beginning and 1.3 GB in the end (delta: -319.4 MB). Peak memory consumption was 172.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:18,729 INFO L168 Benchmark]: CDTParser took 1.06 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:40:18,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:18,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:18,731 INFO L168 Benchmark]: Boogie Preprocessor took 36.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:40:18,733 INFO L168 Benchmark]: RCFGBuilder took 525.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:18,734 INFO L168 Benchmark]: BuchiAutomizer took 50297.97 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -219.3 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:18,734 INFO L168 Benchmark]: Witness Printer took 3.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:40:18,737 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 1.06 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 608.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 525.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 50297.97 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -219.3 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[sc1] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[malloc(length2 * sizeof(char))] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 50.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 15.4s. Construction of modules took 1.9s. Büchi inclusion checks took 32.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 162 SDslu, 104 SDs, 0 SdLazy, 146 SolverSat, 39 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 1.9s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital273 mio100 ax100 hnf99 lsp106 ukn81 mio100 lsp32 div124 bol100 ite100 ukn100 eq169 hnf82 smp91 dnf1010 smp32 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 11 VariablesLoop: 6 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...