./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fcd11173df80f9a00fde2714abfd2a4ff8d40757 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 18:50:07,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:50:07,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:50:07,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:50:07,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:50:07,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:50:07,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:50:07,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:50:07,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:50:07,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:50:07,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:50:07,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:50:07,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:50:07,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:50:07,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:50:07,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:50:07,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:50:07,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:50:07,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:50:07,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:50:07,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:50:07,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:50:07,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:50:07,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:50:07,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:50:07,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:50:07,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:50:07,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:50:07,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:50:07,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:50:07,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:50:07,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:50:07,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:50:07,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:50:07,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:50:07,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:50:07,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:50:07,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:50:07,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:50:07,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:50:07,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:50:07,121 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-19 18:50:07,148 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:50:07,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:50:07,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:50:07,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:50:07,150 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:50:07,150 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:50:07,151 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:50:07,151 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:50:07,151 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:50:07,151 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:50:07,151 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:50:07,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:50:07,152 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:50:07,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:50:07,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:50:07,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:50:07,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:50:07,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:50:07,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:50:07,153 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:50:07,154 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:50:07,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:50:07,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:50:07,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:50:07,154 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:50:07,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:50:07,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:50:07,155 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:50:07,155 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:50:07,157 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:50:07,157 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcd11173df80f9a00fde2714abfd2a4ff8d40757 [2020-10-19 18:50:07,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:50:07,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:50:07,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:50:07,524 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:50:07,526 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:50:07,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2020-10-19 18:50:07,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34db9e26b/86c8c9a02363484f989b2b71009f6100/FLAG2bed1cef2 [2020-10-19 18:50:08,123 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:50:08,124 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2020-10-19 18:50:08,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34db9e26b/86c8c9a02363484f989b2b71009f6100/FLAG2bed1cef2 [2020-10-19 18:50:08,417 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34db9e26b/86c8c9a02363484f989b2b71009f6100 [2020-10-19 18:50:08,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:50:08,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:50:08,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:50:08,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:50:08,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:50:08,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:50:08" (1/1) ... [2020-10-19 18:50:08,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356dfd3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:08, skipping insertion in model container [2020-10-19 18:50:08,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:50:08" (1/1) ... [2020-10-19 18:50:08,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:50:08,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:50:08,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:50:09,007 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:50:09,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:50:09,114 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:50:09,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:09 WrapperNode [2020-10-19 18:50:09,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:50:09,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:50:09,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:50:09,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:50:09,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:09" (1/1) ... [2020-10-19 18:50:09,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:09" (1/1) ... [2020-10-19 18:50:09,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:50:09,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:50:09,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:50:09,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:50:09,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:09" (1/1) ... [2020-10-19 18:50:09,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:09" (1/1) ... [2020-10-19 18:50:09,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:09" (1/1) ... [2020-10-19 18:50:09,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:09" (1/1) ... [2020-10-19 18:50:09,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:09" (1/1) ... [2020-10-19 18:50:09,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:09" (1/1) ... [2020-10-19 18:50:09,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:09" (1/1) ... [2020-10-19 18:50:09,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:50:09,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:50:09,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:50:09,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:50:09,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 18:50:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 18:50:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 18:50:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 18:50:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:50:09,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:50:09,565 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:50:09,566 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-19 18:50:09,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:50:09 BoogieIcfgContainer [2020-10-19 18:50:09,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:50:09,568 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:50:09,568 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:50:09,572 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:50:09,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:50:09,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:50:08" (1/3) ... [2020-10-19 18:50:09,574 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d551e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:50:09, skipping insertion in model container [2020-10-19 18:50:09,574 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:50:09,574 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:09" (2/3) ... [2020-10-19 18:50:09,575 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d551e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:50:09, skipping insertion in model container [2020-10-19 18:50:09,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:50:09,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:50:09" (3/3) ... [2020-10-19 18:50:09,579 INFO L373 chiAutomizerObserver]: Analyzing ICFG cstrcspn_diffterm_alloca.i [2020-10-19 18:50:09,691 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:50:09,692 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:50:09,692 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:50:09,692 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:50:09,693 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:50:09,693 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:50:09,693 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:50:09,693 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:50:09,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-19 18:50:09,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:50:09,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:09,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:09,733 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:50:09,733 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-19 18:50:09,733 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:50:09,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-19 18:50:09,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:50:09,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:09,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:09,736 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:50:09,736 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-19 18:50:09,743 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 11#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2020-10-19 18:50:09,743 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2020-10-19 18:50:09,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:09,749 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-10-19 18:50:09,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:09,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572420391] [2020-10-19 18:50:09,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:09,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:09,892 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:09,920 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:09,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:09,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2020-10-19 18:50:09,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:09,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110959646] [2020-10-19 18:50:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:09,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110959646] [2020-10-19 18:50:09,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:50:09,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 18:50:09,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754894816] [2020-10-19 18:50:10,009 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:50:10,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:50:10,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-19 18:50:10,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-19 18:50:10,030 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-10-19 18:50:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:50:10,039 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-10-19 18:50:10,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-19 18:50:10,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-10-19 18:50:10,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:50:10,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2020-10-19 18:50:10,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 18:50:10,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 18:50:10,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-10-19 18:50:10,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:50:10,056 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-10-19 18:50:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-10-19 18:50:10,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-19 18:50:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-19 18:50:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-10-19 18:50:10,086 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-10-19 18:50:10,086 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-10-19 18:50:10,086 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:50:10,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-10-19 18:50:10,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:50:10,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:10,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:10,089 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:50:10,089 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:10,089 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2020-10-19 18:50:10,090 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2020-10-19 18:50:10,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:10,090 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2020-10-19 18:50:10,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:10,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730068863] [2020-10-19 18:50:10,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:10,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:10,151 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:10,158 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:10,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2020-10-19 18:50:10,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:10,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123142780] [2020-10-19 18:50:10,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:10,176 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:10,191 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:10,195 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:10,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:10,196 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2020-10-19 18:50:10,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:10,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207861990] [2020-10-19 18:50:10,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:10,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:10,259 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:10,268 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:10,487 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-10-19 18:50:10,967 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2020-10-19 18:50:11,108 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-10-19 18:50:11,122 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:50:11,123 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:50:11,124 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:50:11,124 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:50:11,124 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:50:11,125 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:11,125 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:50:11,125 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:50:11,125 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration2_Lasso [2020-10-19 18:50:11,126 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:50:11,126 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:50:11,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,567 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-10-19 18:50:11,793 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-10-19 18:50:11,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,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-10-19 18:50:11,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:11,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:12,738 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2020-10-19 18:50:12,853 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:50:12,861 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) [2020-10-19 18:50:12,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:12,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:12,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:12,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:12,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:12,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:12,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:12,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:12,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:12,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:12,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:12,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:12,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:12,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:12,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:12,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:12,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:12,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:12,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:12,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:12,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:12,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:12,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:12,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:12,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:12,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:13,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:13,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:13,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:13,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:13,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:13,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:13,023 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:13,034 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:50:13,109 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-19 18:50:13,109 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:13,175 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:13,179 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:50:13,179 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:50:13,180 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2020-10-19 18:50:13,260 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2020-10-19 18:50:13,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:50:13,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:13,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:50:13,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:13,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:50:13,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:13,383 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 18:50:13,384 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-10-19 18:50:13,441 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2020-10-19 18:50:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 18:50:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:50:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-10-19 18:50:13,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2020-10-19 18:50:13,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:13,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2020-10-19 18:50:13,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:13,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2020-10-19 18:50:13,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:13,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2020-10-19 18:50:13,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:50:13,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2020-10-19 18:50:13,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-19 18:50:13,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 18:50:13,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-10-19 18:50:13,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:50:13,456 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-10-19 18:50:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-10-19 18:50:13,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-19 18:50:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-19 18:50:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-10-19 18:50:13,464 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-10-19 18:50:13,464 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-10-19 18:50:13,465 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:50:13,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-10-19 18:50:13,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:50:13,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:13,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:13,469 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:13,470 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:50:13,470 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 177#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 179#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 189#L372-5 [2020-10-19 18:50:13,470 INFO L796 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 184#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 189#L372-5 [2020-10-19 18:50:13,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:13,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2020-10-19 18:50:13,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:13,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055456123] [2020-10-19 18:50:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:13,487 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:13,501 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:13,506 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:13,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:13,507 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2020-10-19 18:50:13,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:13,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720905735] [2020-10-19 18:50:13,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:13,514 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:13,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:13,522 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:13,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:13,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2020-10-19 18:50:13,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:13,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073215765] [2020-10-19 18:50:13,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:13,545 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:13,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:13,589 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:14,151 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2020-10-19 18:50:14,319 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-19 18:50:14,322 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:50:14,322 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:50:14,322 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:50:14,322 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:50:14,323 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:50:14,323 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:14,323 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:50:14,323 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:50:14,323 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration3_Lasso [2020-10-19 18:50:14,323 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:50:14,323 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:50:14,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,768 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2020-10-19 18:50:14,927 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-10-19 18:50:14,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50: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-10-19 18:50:14,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:14,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:15,280 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2020-10-19 18:50:15,942 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-10-19 18:50:15,977 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:50:15,977 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:15,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:15,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:15,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:15,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:15,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:15,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:15,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:15,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:15,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:16,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:16,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:16,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:16,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:16,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:16,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:16,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:16,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:16,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:16,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:16,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:16,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:16,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:16,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:16,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:16,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:16,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:16,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:16,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:16,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:16,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:16,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:16,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:16,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:16,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:16,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:16,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:16,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:16,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:16,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:16,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:16,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:16,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:16,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:16,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:16,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:16,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:16,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:16,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:16,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:16,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:16,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:16,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:16,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:16,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:16,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:16,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:16,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:16,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:16,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:16,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:16,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:16,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:16,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:16,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:16,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:16,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:16,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:16,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:16,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:16,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:16,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:16,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:16,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:16,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:16,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:16,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:16,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:16,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:16,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:16,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:16,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:16,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:16,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:16,369 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) [2020-10-19 18:50:16,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:16,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:16,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:16,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:16,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:16,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:16,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:16,399 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) [2020-10-19 18:50:16,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:16,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:16,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:16,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:16,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:16,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:16,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:16,460 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:50:16,504 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-19 18:50:16,505 INFO L444 ModelExtractionUtils]: 29 out of 49 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:16,524 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:50:16,531 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:50:16,531 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:50:16,532 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2020-10-19 18:50:16,636 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2020-10-19 18:50:16,638 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:50:16,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:16,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:50:16,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:16,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:50:16,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:16,719 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-19 18:50:16,719 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-19 18:50:16,766 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2020-10-19 18:50:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 18:50:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:50:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-10-19 18:50:16,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2020-10-19 18:50:16,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:16,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2020-10-19 18:50:16,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:16,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2020-10-19 18:50:16,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:16,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2020-10-19 18:50:16,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:50:16,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2020-10-19 18:50:16,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-19 18:50:16,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 18:50:16,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2020-10-19 18:50:16,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:50:16,772 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-10-19 18:50:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2020-10-19 18:50:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2020-10-19 18:50:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-19 18:50:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-10-19 18:50:16,775 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-10-19 18:50:16,775 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-10-19 18:50:16,775 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:50:16,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-10-19 18:50:16,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:50:16,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:16,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:16,777 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:16,777 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:50:16,777 INFO L794 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 370#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 371#L382 assume !(main_~length1~0 < 1); 372#L382-2 assume !(main_~length2~0 < 1); 369#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 365#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 366#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 379#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 375#L372-1 assume !cstrcspn_#t~short210; 376#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209; 361#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 362#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 363#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 364#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 368#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 378#L372-5 [2020-10-19 18:50:16,778 INFO L796 eck$LassoCheckResult]: Loop: 378#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 373#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 374#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 378#L372-5 [2020-10-19 18:50:16,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:16,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2020-10-19 18:50:16,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:16,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960559369] [2020-10-19 18:50:16,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:16,793 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:16,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:16,811 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:16,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:16,812 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2020-10-19 18:50:16,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:16,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960161298] [2020-10-19 18:50:16,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:16,817 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:16,820 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:16,821 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:16,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:16,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2020-10-19 18:50:16,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:16,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853784243] [2020-10-19 18:50:16,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:17,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853784243] [2020-10-19 18:50:17,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519584304] [2020-10-19 18:50:17,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:50:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:17,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-19 18:50:17,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:17,177 INFO L350 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2020-10-19 18:50:17,177 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2020-10-19 18:50:17,178 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:50:17,187 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:50:17,192 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-10-19 18:50:17,192 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:43, output treesize:27 [2020-10-19 18:50:21,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:50:21,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:50:21,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:50:21,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:50:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:21,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:50:21,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-10-19 18:50:21,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530202464] [2020-10-19 18:50:21,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:50:21,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-19 18:50:21,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-19 18:50:21,447 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2020-10-19 18:50:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:50:25,572 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2020-10-19 18:50:25,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 18:50:25,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2020-10-19 18:50:25,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:50:25,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2020-10-19 18:50:25,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 18:50:25,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 18:50:25,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2020-10-19 18:50:25,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:50:25,581 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2020-10-19 18:50:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2020-10-19 18:50:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2020-10-19 18:50:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-19 18:50:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-10-19 18:50:25,585 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-10-19 18:50:25,585 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-10-19 18:50:25,585 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:50:25,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2020-10-19 18:50:25,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:50:25,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:25,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:25,587 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:25,587 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:50:25,588 INFO L794 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 531#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 532#L382 assume !(main_~length1~0 < 1); 533#L382-2 assume !(main_~length2~0 < 1); 530#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 526#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 527#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 546#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 536#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); 537#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209; 522#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 523#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 524#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; 525#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 528#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 539#L372-5 [2020-10-19 18:50:25,588 INFO L796 eck$LassoCheckResult]: Loop: 539#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 534#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); 535#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 539#L372-5 [2020-10-19 18:50:25,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:25,588 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2020-10-19 18:50:25,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:25,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059920884] [2020-10-19 18:50:25,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:25,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:25,639 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:25,649 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:25,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:25,650 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2020-10-19 18:50:25,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:25,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178803986] [2020-10-19 18:50:25,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:25,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:25,669 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:25,671 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:25,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:25,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2020-10-19 18:50:25,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:25,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984522064] [2020-10-19 18:50:25,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:25,713 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:25,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:25,739 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:26,690 WARN L193 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 138 [2020-10-19 18:50:26,984 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-19 18:50:26,986 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:50:26,986 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:50:26,986 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:50:26,986 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:50:26,986 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:50:26,987 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:26,987 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:50:26,987 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:50:26,987 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration5_Lasso [2020-10-19 18:50:26,987 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:50:26,987 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:50:26,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-10-19 18:50:27,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:27,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:27,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:27,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:27,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:27,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:27,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:28,320 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2020-10-19 18:50:28,507 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-10-19 18:50:28,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:28,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:28,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:28,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:28,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:28,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:28,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:28,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:28,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:28,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:28,751 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2020-10-19 18:50:28,937 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-10-19 18:50:30,334 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-10-19 18:50:30,617 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-10-19 18:50:30,741 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:50:30,741 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:30,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:30,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:30,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:30,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:30,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:30,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:30,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:30,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:30,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:30,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:30,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:30,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:30,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:30,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:30,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:30,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:30,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:30,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:30,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:30,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:30,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:30,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:30,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:30,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:30,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:30,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:30,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:30,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:30,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:30,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:30,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:30,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:30,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:30,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:30,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:30,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:30,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:30,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:30,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:30,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:30,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:30,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:30,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:30,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:30,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:30,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:30,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:30,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:30,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:30,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:30,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:30,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:30,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:30,915 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:30,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:30,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:30,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:30,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:30,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:30,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:30,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:30,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:30,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:30,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:30,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:30,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:30,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:30,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:30,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:30,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:30,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:30,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:30,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:30,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:30,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:30,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:30,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:31,018 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:50:31,143 INFO L443 ModelExtractionUtils]: Simplification made 36 calls to the SMT solver. [2020-10-19 18:50:31,143 INFO L444 ModelExtractionUtils]: 11 out of 52 variables were initially zero. Simplification set additionally 38 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:31,146 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:50:31,148 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:50:31,149 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:50:31,149 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2020-10-19 18:50:31,290 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2020-10-19 18:50:31,292 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:50:31,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:31,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:50:31,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:31,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:50:31,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:31,418 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-19 18:50:31,418 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-10-19 18:50:31,482 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2020-10-19 18:50:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 18:50:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:50:31,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-10-19 18:50:31,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-19 18:50:31,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:31,485 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:50:31,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:31,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:50:31,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:31,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:50:31,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:31,597 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-19 18:50:31,597 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-10-19 18:50:31,648 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2020-10-19 18:50:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 18:50:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:50:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-10-19 18:50:31,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-19 18:50:31,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:31,650 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:50:31,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:31,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:50:31,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:31,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:50:31,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:31,749 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-19 18:50:31,749 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-10-19 18:50:31,810 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 45 states and 60 transitions. Complement of second has 5 states. [2020-10-19 18:50:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 18:50:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:50:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-10-19 18:50:31,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-19 18:50:31,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:31,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2020-10-19 18:50:31,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:31,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2020-10-19 18:50:31,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:31,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2020-10-19 18:50:31,819 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:50:31,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2020-10-19 18:50:31,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 18:50:31,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 18:50:31,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 18:50:31,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:50:31,820 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:50:31,820 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:50:31,821 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:50:31,821 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:50:31,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 18:50:31,821 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:50:31,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 18:50:31,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:50:31 BoogieIcfgContainer [2020-10-19 18:50:31,828 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:50:31,829 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:50:31,829 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:50:31,829 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:50:31,830 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:50:09" (3/4) ... [2020-10-19 18:50:31,834 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 18:50:31,834 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:50:31,836 INFO L168 Benchmark]: Toolchain (without parser) took 23413.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 384.8 MB). Free memory was 958.6 MB in the beginning and 1.1 GB in the end (delta: -118.0 MB). Peak memory consumption was 266.8 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:31,837 INFO L168 Benchmark]: CDTParser took 1.37 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:50:31,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 684.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:31,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.77 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-10-19 18:50:31,838 INFO L168 Benchmark]: Boogie Preprocessor took 34.93 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-10-19 18:50:31,839 INFO L168 Benchmark]: RCFGBuilder took 343.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:31,840 INFO L168 Benchmark]: BuchiAutomizer took 22260.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 257.3 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:31,841 INFO L168 Benchmark]: Witness Printer took 5.61 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:50:31,844 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.37 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 684.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.93 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 343.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22260.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 257.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.61 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 16.9s. Construction of modules took 3.9s. Büchi inclusion checks took 1.0s. 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, 167 SDslu, 94 SDs, 0 SdLazy, 144 SolverSat, 36 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.9s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital274 mio100 ax100 hnf99 lsp107 ukn82 mio100 lsp33 div129 bol100 ite100 ukn100 eq166 hnf78 smp87 dnf1059 smp33 tf100 neg94 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...