./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.09_assume-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 25885afdfdd91cf9312b78ad87a032f4ef31fe0c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: No Interpolants --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:34:35,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:34:35,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:34:35,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:34:35,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:34:35,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:34:35,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:34:35,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:34:35,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:34:35,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:34:35,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:34:35,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:34:35,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:34:35,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:34:35,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:34:35,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:34:35,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:34:35,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:34:35,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:34:35,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:34:35,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:34:35,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:34:35,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:34:35,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:34:35,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:34:35,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:34:35,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:34:35,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:34:35,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:34:35,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:34:35,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:34:35,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:34:35,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:34:35,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:34:35,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:34:35,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:34:35,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:34:35,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:34:35,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:34:35,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:34:35,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:34:35,305 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:34:35,347 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:34:35,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:34:35,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:34:35,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:34:35,352 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:34:35,352 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:34:35,352 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:34:35,353 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:34:35,353 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:34:35,353 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:34:35,354 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:34:35,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:34:35,355 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:34:35,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:34:35,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:34:35,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:34:35,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:34:35,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:34:35,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:34:35,359 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:34:35,359 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:34:35,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:34:35,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:34:35,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:34:35,361 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:34:35,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:34:35,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:34:35,362 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:34:35,363 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:34:35,364 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:34:35,365 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 -> 25885afdfdd91cf9312b78ad87a032f4ef31fe0c [2020-07-29 01:34:35,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:34:35,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:34:35,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:34:35,730 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:34:35,731 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:34:35,732 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i [2020-07-29 01:34:35,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168a8c3cb/6319147f37004fb685d65c28e2c18ac0/FLAGb973d485f [2020-07-29 01:34:36,298 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:34:36,298 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i [2020-07-29 01:34:36,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168a8c3cb/6319147f37004fb685d65c28e2c18ac0/FLAGb973d485f [2020-07-29 01:34:36,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168a8c3cb/6319147f37004fb685d65c28e2c18ac0 [2020-07-29 01:34:36,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:34:36,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:34:36,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:36,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:34:36,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:34:36,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:36" (1/1) ... [2020-07-29 01:34:36,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be397b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:36, skipping insertion in model container [2020-07-29 01:34:36,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:36" (1/1) ... [2020-07-29 01:34:36,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:34:36,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:34:37,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:37,290 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:34:37,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:37,426 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:34:37,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:37 WrapperNode [2020-07-29 01:34:37,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:37,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:37,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:34:37,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:34:37,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:37" (1/1) ... [2020-07-29 01:34:37,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:37" (1/1) ... [2020-07-29 01:34:37,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:37,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:34:37,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:34:37,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:34:37,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:37" (1/1) ... [2020-07-29 01:34:37,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:37" (1/1) ... [2020-07-29 01:34:37,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:37" (1/1) ... [2020-07-29 01:34:37,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:37" (1/1) ... [2020-07-29 01:34:37,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:37" (1/1) ... [2020-07-29 01:34:37,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:37" (1/1) ... [2020-07-29 01:34:37,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:37" (1/1) ... [2020-07-29 01:34:37,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:34:37,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:34:37,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:34:37,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:34:37,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:37,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:34:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:34:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:34:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:34:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:34:37,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:34:38,217 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:34:38,218 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:34:38,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:38 BoogieIcfgContainer [2020-07-29 01:34:38,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:34:38,223 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:34:38,223 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:34:38,227 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:34:38,228 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:38,229 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:34:36" (1/3) ... [2020-07-29 01:34:38,230 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b0c242c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:38, skipping insertion in model container [2020-07-29 01:34:38,231 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:38,231 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:37" (2/3) ... [2020-07-29 01:34:38,232 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b0c242c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:38, skipping insertion in model container [2020-07-29 01:34:38,232 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:38,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:38" (3/3) ... [2020-07-29 01:34:38,235 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.09_assume-alloca.i [2020-07-29 01:34:38,294 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:34:38,294 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:34:38,295 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:34:38,295 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:34:38,295 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:34:38,295 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:34:38,295 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:34:38,295 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:34:38,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:34:38,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:38,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:38,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:38,352 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:34:38,352 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:38,352 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:34:38,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:34:38,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:38,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:38,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:38,357 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:34:38,357 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:38,369 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 6#L555true assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 10#L555-2true assume !test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 7#L558-3true [2020-07-29 01:34:38,370 INFO L796 eck$LassoCheckResult]: Loop: 7#L558-3true call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 4#L558-1true assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 16#L559true assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 5#L559-2true call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 7#L558-3true [2020-07-29 01:34:38,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:38,377 INFO L82 PathProgramCache]: Analyzing trace with hash 925673, now seen corresponding path program 1 times [2020-07-29 01:34:38,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:38,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464322660] [2020-07-29 01:34:38,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:38,554 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:38,604 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:38,635 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:38,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1482703, now seen corresponding path program 1 times [2020-07-29 01:34:38,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:38,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131716165] [2020-07-29 01:34:38,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:38,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:38,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:38,671 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:38,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:38,673 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 1 times [2020-07-29 01:34:38,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:38,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799568830] [2020-07-29 01:34:38,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:38,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:38,822 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:38,843 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:39,768 WARN L193 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2020-07-29 01:34:39,991 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-29 01:34:40,009 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:40,010 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:40,011 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:40,011 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:40,011 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:40,012 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:40,012 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:40,012 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:40,012 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca.i_Iteration1_Lasso [2020-07-29 01:34:40,013 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:40,013 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:40,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,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-07-29 01:34:40,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-07-29 01:34:40,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,702 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2020-07-29 01:34:40,904 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2020-07-29 01:34:40,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:40,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:42,107 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:42,115 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-07-29 01:34:42,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:42,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:42,145 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-07-29 01:34:42,152 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) [2020-07-29 01:34:42,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:42,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:42,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:42,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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-07-29 01:34:42,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:42,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:42,286 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-07-29 01:34:42,292 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) [2020-07-29 01:34:42,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:42,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:42,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:42,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:42,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:42,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:42,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:42,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:42,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:42,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:42,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:42,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:42,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:42,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:42,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:42,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:42,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:42,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:42,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:42,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:42,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:42,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:42,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:42,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:42,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:42,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:42,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:42,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:42,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:42,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:42,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:42,713 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-07-29 01:34:42,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:42,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:42,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:42,751 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-07-29 01:34:42,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:42,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:42,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:42,782 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-07-29 01:34:42,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:42,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:42,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:42,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:42,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:42,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:42,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:42,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:42,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:42,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:42,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:42,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:42,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:42,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:42,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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:42,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:42,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:42,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:42,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:42,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:43,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:43,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:43,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:43,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:43,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:43,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:43,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:43,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,096 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:34:43,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,116 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 01:34:43,116 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:34:43,158 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:43,256 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 01:34:43,257 INFO L444 ModelExtractionUtils]: 38 out of 46 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:43,263 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:43,328 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2020-07-29 01:34:43,328 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:43,329 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 >= 0] [2020-07-29 01:34:43,529 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2020-07-29 01:34:43,545 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);" "assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11;" "call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15;" [2020-07-29 01:34:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:43,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:43,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:43,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:34:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:43,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:43,726 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-07-29 01:34:43,743 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:43,754 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:43,762 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:43,762 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2020-07-29 01:34:43,766 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:43,766 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_80|, |ULTIMATE.start_test_fun_#t~malloc3.base|]. (and (<= (select (store (store |v_#valid_80| ULTIMATE.start_test_fun_~x_ref~0.base 1) |ULTIMATE.start_test_fun_#t~malloc3.base| 1) ULTIMATE.start_test_fun_~c~0.base) 0) unseeded) [2020-07-29 01:34:43,766 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded) [2020-07-29 01:34:43,809 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:43,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {24#unseeded} is VALID [2020-07-29 01:34:43,900 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#unseeded} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; {176#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:34:43,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {176#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; {180#(and (or |ULTIMATE.start_test_fun_#t~short7| (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:34:43,903 INFO L280 TraceCheckUtils]: 3: Hoare triple {180#(and (or |ULTIMATE.start_test_fun_#t~short7| (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume !test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; {164#(and (>= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:34:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:43,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:34:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:43,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:44,142 INFO L350 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2020-07-29 01:34:44,143 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2020-07-29 01:34:44,186 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-29 01:34:44,202 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:44,222 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:44,223 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:44,223 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:52 [2020-07-29 01:34:44,242 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:44,242 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_57|]. (let ((.cse1 (select |v_#memory_int_57| ULTIMATE.start_test_fun_~x_ref~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_test_fun_~x_ref~0.offset)) (.cse2 (select (select |v_#memory_int_57| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (and (<= .cse0 oldRank0) (= |#memory_int| (store |v_#memory_int_57| ULTIMATE.start_test_fun_~x_ref~0.base (store .cse1 ULTIMATE.start_test_fun_~x_ref~0.offset .cse2))) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= (+ .cse2 1) .cse0) (<= 0 .cse2)))) [2020-07-29 01:34:44,242 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (and (= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) .cse0) (<= 0 .cse0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (let ((.cse1 (<= (+ .cse0 1) oldRank0))) (or (and (not (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset)) .cse1) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) .cse1))))) [2020-07-29 01:34:44,286 INFO L280 TraceCheckUtils]: 0: Hoare triple {165#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (>= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)))} call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {165#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (>= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)))} is VALID [2020-07-29 01:34:44,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {165#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (>= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)))} assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {187#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem10|) (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= |ULTIMATE.start_test_fun_#t~mem9| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} is VALID [2020-07-29 01:34:44,290 INFO L280 TraceCheckUtils]: 2: Hoare triple {187#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem10|) (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= |ULTIMATE.start_test_fun_#t~mem9| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; {191#(and (= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (or (and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) oldRank0))) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)))} is VALID [2020-07-29 01:34:44,296 INFO L280 TraceCheckUtils]: 3: Hoare triple {191#(and (= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (or (and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) oldRank0))) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)))} call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; {167#(and (>= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:34:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:44,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:34:44,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:44,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:44,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,352 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2020-07-29 01:34:44,354 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2020-07-29 01:34:44,565 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 7 states. Result 44 states and 54 transitions. Complement of second has 10 states. [2020-07-29 01:34:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:44,566 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:44,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:34:44,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:44,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:44,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:44,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:34:44,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:34:44,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:44,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:44,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2020-07-29 01:34:44,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:44,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:44,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:44,582 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states. [2020-07-29 01:34:44,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:44,587 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:34:44,588 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:34:44,590 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:34:44,591 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:44,591 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 44 states and 54 transitions. cyclomatic complexity: 12 [2020-07-29 01:34:44,593 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:34:44,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:44,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:44,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:44,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:44,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:44,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:44,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:44,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:44,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:44,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 44 letters. Loop has 44 letters. [2020-07-29 01:34:44,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 44 letters. Loop has 44 letters. [2020-07-29 01:34:44,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 44 letters. Loop has 44 letters. [2020-07-29 01:34:44,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:44,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:44,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:44,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:44,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:44,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:44,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:44,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:44,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:44,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:44,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:44,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:44,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:44,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:44,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:44,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:44,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:44,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:44,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:34:44,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:34:44,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:34:44,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:34:44,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:34:44,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:34:44,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:44,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:44,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:44,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:34:44,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:34:44,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:34:44,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:34:44,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:34:44,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:34:44,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:34:44,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:34:44,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:34:44,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 12 letters. Loop has 5 letters. [2020-07-29 01:34:44,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 5 letters. [2020-07-29 01:34:44,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 5 letters. [2020-07-29 01:34:44,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:44,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:44,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:44,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,620 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:34:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2020-07-29 01:34:44,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:44,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:44,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 4 letters. Loop has 8 letters. [2020-07-29 01:34:44,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 54 transitions. cyclomatic complexity: 12 [2020-07-29 01:34:44,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:44,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 19 states and 23 transitions. [2020-07-29 01:34:44,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:34:44,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 01:34:44,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2020-07-29 01:34:44,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:44,640 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-07-29 01:34:44,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2020-07-29 01:34:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-07-29 01:34:44,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:44,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 23 transitions. Second operand 17 states. [2020-07-29 01:34:44,674 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 23 transitions. Second operand 17 states. [2020-07-29 01:34:44,677 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 17 states. [2020-07-29 01:34:44,682 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:44,685 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2020-07-29 01:34:44,686 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2020-07-29 01:34:44,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:44,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:44,688 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 19 states and 23 transitions. [2020-07-29 01:34:44,688 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 19 states and 23 transitions. [2020-07-29 01:34:44,689 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:44,691 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-07-29 01:34:44,692 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-07-29 01:34:44,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:44,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:44,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:44,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:34:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-07-29 01:34:44,696 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-07-29 01:34:44,697 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-07-29 01:34:44,697 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:34:44,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2020-07-29 01:34:44,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:44,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:44,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:44,699 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:44,699 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:34:44,699 INFO L794 eck$LassoCheckResult]: Stem: 259#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 255#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 256#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 257#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 258#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 265#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 266#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 269#L562 [2020-07-29 01:34:44,700 INFO L796 eck$LassoCheckResult]: Loop: 269#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 260#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 261#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 271#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 270#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 269#L562 [2020-07-29 01:34:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:44,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1806938606, now seen corresponding path program 1 times [2020-07-29 01:34:44,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:44,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267412106] [2020-07-29 01:34:44,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:44,753 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:44,805 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:44,811 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:44,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:44,812 INFO L82 PathProgramCache]: Analyzing trace with hash 60166068, now seen corresponding path program 1 times [2020-07-29 01:34:44,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:44,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949403495] [2020-07-29 01:34:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:44,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:44,831 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:44,834 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:44,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:44,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1913288217, now seen corresponding path program 1 times [2020-07-29 01:34:44,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:44,836 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568475910] [2020-07-29 01:34:44,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:44,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:44,902 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:44,908 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:45,644 WARN L193 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 104 [2020-07-29 01:34:45,841 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-07-29 01:34:45,854 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:45,854 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:45,854 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:45,855 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:45,855 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:45,855 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:45,855 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:45,855 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:45,855 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca.i_Iteration2_Lasso [2020-07-29 01:34:45,856 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:45,856 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:45,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:45,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,328 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-07-29 01:34:46,516 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-07-29 01:34:46,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,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-07-29 01:34:46,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:47,801 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:47,802 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:47,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:47,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:47,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:47,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:47,816 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-07-29 01:34:47,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:47,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,845 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:34:47,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,870 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 01:34:47,870 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:34:47,938 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:47,995 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 01:34:47,995 INFO L444 ModelExtractionUtils]: 35 out of 51 variables were initially zero. Simplification set additionally 12 variables to zero. 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) [2020-07-29 01:34:47,999 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:48,005 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2020-07-29 01:34:48,005 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:48,005 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 - 1 >= 0] [2020-07-29 01:34:48,181 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2020-07-29 01:34:48,192 INFO L393 LassoCheck]: Loop: "assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14;" "call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15;" "call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);" "assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);" [2020-07-29 01:34:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:48,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:48,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:48,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:34:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:48,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:48,277 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:48,323 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-07-29 01:34:48,329 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:48,340 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-07-29 01:34:48,347 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:48,390 INFO L624 ElimStorePlain]: treesize reduction 2, result has 93.5 percent of original size [2020-07-29 01:34:48,395 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-07-29 01:34:48,395 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:21 [2020-07-29 01:34:48,398 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:48,398 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_135|, |ULTIMATE.start_test_fun_#t~malloc3.base|]. (let ((.cse0 (<= (select (store (store |v_#valid_135| ULTIMATE.start_test_fun_~x_ref~0.base 1) |ULTIMATE.start_test_fun_#t~malloc3.base| 1) ULTIMATE.start_test_fun_~c~0.base) 0))) (or (and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not |ULTIMATE.start_test_fun_#t~short7|) .cse0 unseeded) (and .cse0 |ULTIMATE.start_test_fun_#t~short7| unseeded))) [2020-07-29 01:34:48,398 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)))) (or (and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) .cse0 unseeded) (and |ULTIMATE.start_test_fun_#t~short7| .cse0 unseeded))) [2020-07-29 01:34:48,454 INFO L280 TraceCheckUtils]: 0: Hoare triple {364#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {364#unseeded} is VALID [2020-07-29 01:34:48,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {364#unseeded} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; {516#(or (and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded) (and |ULTIMATE.start_test_fun_#t~short7| (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded))} is VALID [2020-07-29 01:34:48,457 INFO L280 TraceCheckUtils]: 2: Hoare triple {516#(or (and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded) (and |ULTIMATE.start_test_fun_#t~short7| (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded))} assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:34:48,458 INFO L280 TraceCheckUtils]: 3: Hoare triple {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume !test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:34:48,465 INFO L280 TraceCheckUtils]: 4: Hoare triple {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:34:48,466 INFO L280 TraceCheckUtils]: 5: Hoare triple {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:34:48,467 INFO L280 TraceCheckUtils]: 6: Hoare triple {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:34:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:48,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:34:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:48,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:48,506 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2020-07-29 01:34:48,510 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:48,519 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:48,519 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:48,520 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:25 [2020-07-29 01:34:50,971 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:50,972 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_98|]. (let ((.cse0 (select |v_#memory_int_98| ULTIMATE.start_test_fun_~x_ref~0.base))) (let ((.cse1 (select .cse0 ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (= |#memory_int| (store |v_#memory_int_98| ULTIMATE.start_test_fun_~x_ref~0.base (store .cse0 ULTIMATE.start_test_fun_~x_ref~0.offset (+ .cse1 (- 1))))) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= .cse1 oldRank0) (<= 1 (* 2 .cse1))))) [2020-07-29 01:34:50,972 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (<= (+ .cse0 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 .cse0) 1)))) [2020-07-29 01:34:51,032 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2020-07-29 01:34:51,037 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:51,056 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:51,056 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:51,056 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:25 [2020-07-29 01:35:03,702 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:03,703 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_99|, ULTIMATE.start_test_fun_~c~0.offset]. (let ((.cse1 (select (select |v_#memory_int_99| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (= |#memory_int| (store |v_#memory_int_99| ULTIMATE.start_test_fun_~c~0.base (let ((.cse0 (select |v_#memory_int_99| ULTIMATE.start_test_fun_~c~0.base))) (store .cse0 ULTIMATE.start_test_fun_~c~0.offset (+ (select .cse0 ULTIMATE.start_test_fun_~c~0.offset) 1))))) (<= 0 (+ (* 2 .cse1) 1)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= (+ .cse1 1) oldRank0))) [2020-07-29 01:35:03,703 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (<= (+ .cse0 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 .cse0) 1)))) [2020-07-29 01:35:03,869 INFO L280 TraceCheckUtils]: 0: Hoare triple {505#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)))} assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; {532#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} is VALID [2020-07-29 01:35:03,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {532#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; {532#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} is VALID [2020-07-29 01:35:03,873 INFO L280 TraceCheckUtils]: 2: Hoare triple {532#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {539#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (= |ULTIMATE.start_test_fun_#t~mem8| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} is VALID [2020-07-29 01:35:03,874 INFO L280 TraceCheckUtils]: 3: Hoare triple {539#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (= |ULTIMATE.start_test_fun_#t~mem8| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {543#(and (not (= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} is VALID [2020-07-29 01:35:03,876 INFO L280 TraceCheckUtils]: 4: Hoare triple {543#(and (not (= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {507#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:35:03,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:03,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:35:03,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:03,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:03,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,913 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2020-07-29 01:35:03,913 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-07-29 01:35:04,127 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 31 transitions. Complement of second has 6 states. [2020-07-29 01:35:04,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 0 non-accepting loop states 2 accepting loop states [2020-07-29 01:35:04,127 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:04,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. cyclomatic complexity: 6 [2020-07-29 01:35:04,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:04,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:04,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:35:04,129 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:04,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:04,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2020-07-29 01:35:04,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:04,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:04,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:04,132 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 21 transitions. cyclomatic complexity: 6 [2020-07-29 01:35:04,133 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:35:04,133 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:35:04,134 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:04,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 16 transitions. cyclomatic complexity: 12 [2020-07-29 01:35:04,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:04,135 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:35:04,135 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 31 transitions. cyclomatic complexity: 6 [2020-07-29 01:35:04,137 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:35:04,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:04,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:04,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:04,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:04,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:04,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:04,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:35:04,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:35:04,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:35:04,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:35:04,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:35:04,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:35:04,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:04,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:04,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:04,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:35:04,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:35:04,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:35:04,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:35:04,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:35:04,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:35:04,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:04,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:04,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:04,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:04,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:04,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:04,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:04,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:04,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:04,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:04,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:04,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:04,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:04,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:04,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:04,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:35:04,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:35:04,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:35:04,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 5 letters. [2020-07-29 01:35:04,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 5 letters. [2020-07-29 01:35:04,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 5 letters. [2020-07-29 01:35:04,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:35:04,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:35:04,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:35:04,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,151 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:35:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2020-07-29 01:35:04,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:04,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,153 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:35:04,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:04,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:35:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:04,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:04,258 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:04,316 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-07-29 01:35:04,321 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:04,334 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-07-29 01:35:04,340 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:04,399 INFO L624 ElimStorePlain]: treesize reduction 2, result has 93.5 percent of original size [2020-07-29 01:35:04,404 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-07-29 01:35:04,404 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:21 [2020-07-29 01:35:04,410 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:04,410 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_136|, |ULTIMATE.start_test_fun_#t~malloc3.base|]. (let ((.cse0 (<= (select (store (store |v_#valid_136| ULTIMATE.start_test_fun_~x_ref~0.base 1) |ULTIMATE.start_test_fun_#t~malloc3.base| 1) ULTIMATE.start_test_fun_~c~0.base) 0))) (or (and .cse0 |ULTIMATE.start_test_fun_#t~short7| unseeded) (and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not |ULTIMATE.start_test_fun_#t~short7|) .cse0 unseeded))) [2020-07-29 01:35:04,410 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)))) (or (and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) .cse0 unseeded) (and |ULTIMATE.start_test_fun_#t~short7| .cse0 unseeded))) [2020-07-29 01:35:04,479 INFO L280 TraceCheckUtils]: 0: Hoare triple {364#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {364#unseeded} is VALID [2020-07-29 01:35:04,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {364#unseeded} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; {595#(or (and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded) (and |ULTIMATE.start_test_fun_#t~short7| (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded))} is VALID [2020-07-29 01:35:04,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {595#(or (and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded) (and |ULTIMATE.start_test_fun_#t~short7| (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded))} assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:04,486 INFO L280 TraceCheckUtils]: 3: Hoare triple {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume !test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:04,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:04,489 INFO L280 TraceCheckUtils]: 5: Hoare triple {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:04,490 INFO L280 TraceCheckUtils]: 6: Hoare triple {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {504#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:04,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:35:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:04,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:04,531 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2020-07-29 01:35:04,534 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:04,544 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:04,545 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:35:04,545 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:25 [2020-07-29 01:35:09,000 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:09,001 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_100|]. (let ((.cse1 (select |v_#memory_int_100| ULTIMATE.start_test_fun_~x_ref~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (<= 1 (* 2 .cse0)) (= (store |v_#memory_int_100| ULTIMATE.start_test_fun_~x_ref~0.base (store .cse1 ULTIMATE.start_test_fun_~x_ref~0.offset (+ .cse0 (- 1)))) |#memory_int|) (<= .cse0 oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base))))) [2020-07-29 01:35:09,001 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (<= (+ .cse0 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 .cse0) 1)))) [2020-07-29 01:35:09,066 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2020-07-29 01:35:09,071 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:09,080 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:09,080 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:35:09,081 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:25 [2020-07-29 01:35:21,327 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:21,327 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_101|, ULTIMATE.start_test_fun_~c~0.offset]. (let ((.cse0 (select (select |v_#memory_int_101| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (<= 0 (+ (* 2 .cse0) 1)) (<= (+ .cse0 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (= |#memory_int| (store |v_#memory_int_101| ULTIMATE.start_test_fun_~c~0.base (let ((.cse1 (select |v_#memory_int_101| ULTIMATE.start_test_fun_~c~0.base))) (store .cse1 ULTIMATE.start_test_fun_~c~0.offset (+ (select .cse1 ULTIMATE.start_test_fun_~c~0.offset) 1))))))) [2020-07-29 01:35:21,328 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (<= (+ .cse0 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 .cse0) 1)))) [2020-07-29 01:35:21,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {505#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)))} assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; {611#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} is VALID [2020-07-29 01:35:21,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {611#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; {611#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} is VALID [2020-07-29 01:35:21,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {611#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {618#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (= |ULTIMATE.start_test_fun_#t~mem8| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} is VALID [2020-07-29 01:35:21,490 INFO L280 TraceCheckUtils]: 3: Hoare triple {618#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (= |ULTIMATE.start_test_fun_#t~mem8| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {622#(and (not (= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} is VALID [2020-07-29 01:35:21,494 INFO L280 TraceCheckUtils]: 4: Hoare triple {622#(and (not (= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= 0 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 1)))} assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {507#(and (>= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (- 1)) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:35:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:21,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:35:21,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:21,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:21,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,544 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 4 loop predicates [2020-07-29 01:35:21,544 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-07-29 01:35:21,898 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 35 states and 41 transitions. Complement of second has 12 states. [2020-07-29 01:35:21,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 4 non-accepting loop states 2 accepting loop states [2020-07-29 01:35:21,899 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:21,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. cyclomatic complexity: 6 [2020-07-29 01:35:21,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:21,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:21,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:35:21,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:35:21,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:21,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:21,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2020-07-29 01:35:21,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:21,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:21,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:21,903 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 21 transitions. cyclomatic complexity: 6 [2020-07-29 01:35:21,903 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:35:21,903 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:35:21,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:35:21,904 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:21,904 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 41 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:21,906 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:35:21,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:21,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:21,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:21,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:21,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:21,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:21,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:35:21,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:35:21,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:35:21,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:35:21,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:35:21,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:35:21,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:35:21,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:35:21,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:35:21,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:35:21,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:35:21,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:35:21,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:35:21,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:35:21,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:35:21,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:35:21,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:35:21,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:35:21,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:21,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:21,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:21,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:21,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:21,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:21,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:21,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:21,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:21,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:21,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:21,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:21,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:35:21,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:35:21,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:35:21,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:35:21,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:35:21,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:35:21,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:35:21,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:35:21,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:35:21,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:35:21,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:35:21,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:35:21,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 21 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 5 letters. [2020-07-29 01:35:21,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 16 letters. Loop has 5 letters. [2020-07-29 01:35:21,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 41 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 5 letters. [2020-07-29 01:35:21,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,920 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:35:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2020-07-29 01:35:21,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:21,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 12 letters. Loop has 5 letters. [2020-07-29 01:35:21,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:35:21,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:21,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:21,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 35 transitions. [2020-07-29 01:35:21,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 01:35:21,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-07-29 01:35:21,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2020-07-29 01:35:21,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:21,933 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2020-07-29 01:35:21,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2020-07-29 01:35:21,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-07-29 01:35:21,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:21,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 35 transitions. Second operand 25 states. [2020-07-29 01:35:21,940 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 35 transitions. Second operand 25 states. [2020-07-29 01:35:21,940 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 25 states. [2020-07-29 01:35:21,940 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:21,942 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-07-29 01:35:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-29 01:35:21,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:21,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:21,943 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 30 states and 35 transitions. [2020-07-29 01:35:21,943 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 30 states and 35 transitions. [2020-07-29 01:35:21,944 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:21,946 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-07-29 01:35:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-29 01:35:21,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:21,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:21,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:21,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 01:35:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2020-07-29 01:35:21,948 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2020-07-29 01:35:21,948 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2020-07-29 01:35:21,948 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:35:21,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2020-07-29 01:35:21,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:21,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:21,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:21,950 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:21,950 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:21,950 INFO L794 eck$LassoCheckResult]: Stem: 688#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 684#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 685#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 686#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 687#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 695#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 696#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 701#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 705#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 708#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 700#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 697#L562 [2020-07-29 01:35:21,950 INFO L796 eck$LassoCheckResult]: Loop: 697#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 689#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 690#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 693#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 694#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 697#L562 [2020-07-29 01:35:21,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash 629214048, now seen corresponding path program 1 times [2020-07-29 01:35:21,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:21,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747327089] [2020-07-29 01:35:21,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:21,974 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:21,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:22,000 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:22,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:22,001 INFO L82 PathProgramCache]: Analyzing trace with hash 60166068, now seen corresponding path program 2 times [2020-07-29 01:35:22,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:22,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302545968] [2020-07-29 01:35:22,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:22,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:22,017 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:22,019 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:22,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1910487115, now seen corresponding path program 1 times [2020-07-29 01:35:22,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:22,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499220204] [2020-07-29 01:35:22,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:22,049 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:22,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:22,085 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:22,266 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-07-29 01:35:22,412 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-29 01:35:24,641 WARN L193 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 159 DAG size of output: 127 [2020-07-29 01:35:25,379 WARN L193 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-07-29 01:35:25,390 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:25,390 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:25,390 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:25,390 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:25,390 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:25,390 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:25,390 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:25,391 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:25,391 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca.i_Iteration3_Lasso [2020-07-29 01:35:25,391 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:25,391 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:25,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:25,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:26,316 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-07-29 01:35:26,604 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-07-29 01:35:26,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:27,474 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-07-29 01:35:28,358 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:28,358 INFO L489 LassoAnalysis]: Using template 'affine'. 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-07-29 01:35:28,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:28,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:28,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:28,372 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-07-29 01:35:28,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:28,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:28,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:28,398 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-07-29 01:35:28,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:28,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:28,430 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 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-07-29 01:35:28,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:28,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:28,466 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:28,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:28,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:28,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,508 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:28,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:28,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:28,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,554 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 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:28,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:28,595 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:28,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:28,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:28,623 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:28,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:28,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:28,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,670 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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:28,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:28,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:28,708 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:28,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:28,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:28,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:28,762 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:28,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:28,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:28,766 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 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:28,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:28,798 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:28,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:28,831 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 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:28,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:28,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:28,861 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 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:28,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:28,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:28,887 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:28,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:28,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:28,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,915 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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:28,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:28,944 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 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:28,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:28,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:28,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:28,976 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 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:29,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:29,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:29,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:29,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:29,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:29,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:29,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:29,003 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:29,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:29,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:29,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:29,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:29,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:29,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:29,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:29,037 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 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:29,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:29,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:29,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:29,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:29,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:29,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:29,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:29,079 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 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:29,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:29,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:29,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:29,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:29,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:29,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:29,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:29,133 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:29,157 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:29,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:29,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:29,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:29,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:29,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:29,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:29,167 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:29,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:29,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:29,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:29,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:29,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:29,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:29,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:29,196 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:29,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:29,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:29,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:29,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:29,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:29,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:29,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:29,228 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 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:29,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-07-29 01:35:29,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:29,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:29,255 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:35:29,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:29,267 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 01:35:29,267 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:35:29,314 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:29,388 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2020-07-29 01:35:29,389 INFO L444 ModelExtractionUtils]: 33 out of 51 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:29,391 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:35:29,395 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2020-07-29 01:35:29,395 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:29,395 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem12) = 1*ULTIMATE.start_test_fun_#t~mem12 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 + 1*ULTIMATE.start_test_fun_#t~mem12 >= 0] [2020-07-29 01:35:29,614 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2020-07-29 01:35:29,631 INFO L393 LassoCheck]: Loop: "assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14;" "call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15;" "call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);" "assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);" [2020-07-29 01:35:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:29,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:29,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:35:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:29,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:29,758 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-07-29 01:35:29,763 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:29,771 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:29,778 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:35:29,778 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2020-07-29 01:35:29,782 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:29,783 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_191|, |ULTIMATE.start_test_fun_#t~malloc3.base|]. (and (<= (select (store (store |v_#valid_191| ULTIMATE.start_test_fun_~x_ref~0.base 1) |ULTIMATE.start_test_fun_#t~malloc3.base| 1) ULTIMATE.start_test_fun_~c~0.base) 0) unseeded) [2020-07-29 01:35:29,783 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded) [2020-07-29 01:35:29,831 INFO L280 TraceCheckUtils]: 0: Hoare triple {841#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {841#unseeded} is VALID [2020-07-29 01:35:29,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {841#unseeded} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:29,837 INFO L280 TraceCheckUtils]: 2: Hoare triple {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:29,838 INFO L280 TraceCheckUtils]: 3: Hoare triple {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume !test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:29,840 INFO L280 TraceCheckUtils]: 4: Hoare triple {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:29,842 INFO L280 TraceCheckUtils]: 5: Hoare triple {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:29,844 INFO L280 TraceCheckUtils]: 6: Hoare triple {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:29,845 INFO L280 TraceCheckUtils]: 7: Hoare triple {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:29,847 INFO L280 TraceCheckUtils]: 8: Hoare triple {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:29,849 INFO L280 TraceCheckUtils]: 9: Hoare triple {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:29,850 INFO L280 TraceCheckUtils]: 10: Hoare triple {993#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {981#(and (>= (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) |ULTIMATE.start_test_fun_#t~mem12|) 0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:35:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:29,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:35:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:29,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:29,972 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-29 01:35:29,976 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:29,990 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:29,990 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:35:29,991 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2020-07-29 01:35:33,717 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:33,717 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_144|]. (let ((.cse1 (select |v_#memory_int_144| ULTIMATE.start_test_fun_~x_ref~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (<= 1 oldRank0) (<= .cse0 oldRank0) (= |#memory_int| (store |v_#memory_int_144| ULTIMATE.start_test_fun_~x_ref~0.base (store .cse1 ULTIMATE.start_test_fun_~x_ref~0.offset (+ .cse0 (- 1))))) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base))))) [2020-07-29 01:35:33,718 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 1 oldRank0) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~c~0.base))) [2020-07-29 01:35:33,806 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2020-07-29 01:35:33,817 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:33,829 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:33,829 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:35:33,829 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:17 [2020-07-29 01:35:45,828 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2020-07-29 01:35:45,829 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: No Interpolants at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.getInterpolants(InterpolatingTraceCheck.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:738) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:551) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 01:35:45,835 INFO L168 Benchmark]: Toolchain (without parser) took 69192.54 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 375.4 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -264.9 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:45,836 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:45,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:45,837 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:45,837 INFO L168 Benchmark]: Boogie Preprocessor took 34.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:45,838 INFO L168 Benchmark]: RCFGBuilder took 687.43 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:45,838 INFO L168 Benchmark]: BuchiAutomizer took 67608.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 248.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -155.9 MB). Peak memory consumption was 92.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:45,842 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 782.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 687.43 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 67608.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 248.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -155.9 MB). Peak memory consumption was 92.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: No Interpolants de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: No Interpolants: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.getInterpolants(InterpolatingTraceCheck.java:149) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...