./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.13-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.13-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 72925b65ef321f719f00e79529e35268c3f3eaa3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:34:39,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:34:39,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:34:39,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:34:39,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:34:39,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:34:39,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:34:39,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:34:39,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:34:39,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:34:39,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:34:39,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:34:39,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:34:39,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:34:39,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:34:39,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:34:39,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:34:39,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:34:39,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:34:39,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:34:39,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:34:39,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:34:39,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:34:39,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:34:39,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:34:39,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:34:39,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:34:39,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:34:39,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:34:39,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:34:39,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:34:39,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:34:39,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:34:39,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:34:39,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:34:39,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:34:39,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:34:39,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:34:39,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:34:39,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:34:39,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:34:39,390 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:39,430 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:34:39,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:34:39,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:34:39,435 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:34:39,435 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:34:39,436 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:34:39,436 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:34:39,436 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:34:39,436 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:34:39,436 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:34:39,437 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:34:39,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:34:39,441 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:34:39,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:34:39,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:34:39,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:34:39,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:34:39,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:34:39,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:34:39,443 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:34:39,443 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:34:39,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:34:39,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:34:39,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:34:39,444 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:34:39,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:34:39,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:34:39,445 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:34:39,445 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:34:39,446 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:34:39,447 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 -> 72925b65ef321f719f00e79529e35268c3f3eaa3 [2020-07-29 01:34:39,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:34:39,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:34:39,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:34:39,830 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:34:39,830 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:34:39,833 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2020-07-29 01:34:39,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1293a0edc/45ab18cacb3e4701ae840f17f4328cce/FLAGee516e1d3 [2020-07-29 01:34:40,438 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:34:40,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2020-07-29 01:34:40,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1293a0edc/45ab18cacb3e4701ae840f17f4328cce/FLAGee516e1d3 [2020-07-29 01:34:40,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1293a0edc/45ab18cacb3e4701ae840f17f4328cce [2020-07-29 01:34:40,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:34:40,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:34:40,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:40,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:34:40,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:34:40,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:40" (1/1) ... [2020-07-29 01:34:40,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@472db69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:40, skipping insertion in model container [2020-07-29 01:34:40,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:40" (1/1) ... [2020-07-29 01:34:40,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:34:40,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:34:41,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:41,236 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:34:41,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:41,334 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:34:41,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41 WrapperNode [2020-07-29 01:34:41,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:41,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:41,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:34:41,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:34:41,347 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:41" (1/1) ... [2020-07-29 01:34:41,365 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:41" (1/1) ... [2020-07-29 01:34:41,396 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:41,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:34:41,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:34:41,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:34:41,408 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:41" (1/1) ... [2020-07-29 01:34:41,408 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:41" (1/1) ... [2020-07-29 01:34:41,411 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:41" (1/1) ... [2020-07-29 01:34:41,412 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:41" (1/1) ... [2020-07-29 01:34:41,419 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:41" (1/1) ... [2020-07-29 01:34:41,425 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:41" (1/1) ... [2020-07-29 01:34:41,427 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:41" (1/1) ... [2020-07-29 01:34:41,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:34:41,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:34:41,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:34:41,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:34:41,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:34:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:34:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:34:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:34:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:34:41,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:34:41,901 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:34:41,902 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:34:41,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:41 BoogieIcfgContainer [2020-07-29 01:34:41,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:34:41,907 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:34:41,907 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:34:41,912 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:34:41,913 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:41,913 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:34:40" (1/3) ... [2020-07-29 01:34:41,915 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43d278fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:41, skipping insertion in model container [2020-07-29 01:34:41,915 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:41,916 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41" (2/3) ... [2020-07-29 01:34:41,916 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43d278fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:41, skipping insertion in model container [2020-07-29 01:34:41,916 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:41,916 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:41" (3/3) ... [2020-07-29 01:34:41,921 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.13-alloca.i [2020-07-29 01:34:41,991 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:34:41,991 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:34:41,991 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:34:41,991 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:34:41,992 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:34:41,992 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:34:41,992 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:34:41,992 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:34:42,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:34:42,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:42,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:42,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:42,055 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:42,056 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:42,056 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:34:42,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:34:42,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:42,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:42,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:42,062 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:42,062 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:42,074 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 14#L561-2true [2020-07-29 01:34:42,075 INFO L796 eck$LassoCheckResult]: Loop: 14#L561-2true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 8#L557-1true assume test_fun_#t~short10; 12#L557-3true assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 4#L558true assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 14#L561-2true [2020-07-29 01:34:42,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:42,083 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:34:42,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:42,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69869922] [2020-07-29 01:34:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:42,282 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:42,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:42,372 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:42,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:42,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2020-07-29 01:34:42,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:42,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227022857] [2020-07-29 01:34:42,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:42,390 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:42,407 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:42,416 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:42,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:42,419 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2020-07-29 01:34:42,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:42,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335648999] [2020-07-29 01:34:42,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:42,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:42,599 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:42,613 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:42,754 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2020-07-29 01:34:43,773 WARN L193 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 106 [2020-07-29 01:34:44,203 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-07-29 01:34:44,221 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:44,228 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:44,229 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:44,229 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:44,230 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:44,230 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:44,230 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:44,230 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:44,231 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.13-alloca.i_Iteration1_Lasso [2020-07-29 01:34:44,231 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:44,232 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:44,321 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:44,329 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:44,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,350 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:44,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,362 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:44,367 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:44,372 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:44,378 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:44,383 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:44,394 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:44,399 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,300 WARN L193 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2020-07-29 01:34:45,458 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2020-07-29 01:34:45,478 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,480 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,483 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,494 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,499 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,503 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,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:45,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:45,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,064 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-07-29 01:34:46,781 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:46,788 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,809 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:46,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,844 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:46,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,873 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:46,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,902 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:46,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,908 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:46,938 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:46,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,942 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:46,970 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:46,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:46,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:46,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:47,010 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,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:47,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:47,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:47,021 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:47,055 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,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:47,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:47,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:47,065 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:47,087 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,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:47,106 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:47,128 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,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:47,137 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:47,163 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,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:47,176 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:47,200 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,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:47,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:47,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:47,208 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:47,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:47,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:47,240 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:47,264 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,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:47,276 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:47,299 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,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:47,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:47,364 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:47,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:47,373 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:47,398 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,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:47,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 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:47,430 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,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:47,442 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:47,464 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,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:47,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:47,506 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,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:47,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 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:47,561 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,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:47,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:47,614 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,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:47,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:47,656 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,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:47,684 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) [2020-07-29 01:34:47,730 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,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:47,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:47,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:47,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:47,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:47,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 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,754 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:47,931 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 01:34:47,932 INFO L444 ModelExtractionUtils]: 8 out of 28 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:47,961 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:34:47,969 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:34:47,970 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:47,971 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, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_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 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 Supporting invariants [] [2020-07-29 01:34:48,205 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2020-07-29 01:34:48,211 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7;" "assume test_fun_#t~short10;" "assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);" "assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;" [2020-07-29 01:34:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:48,230 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:48,231 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:48,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:48,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:48,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:48,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {22#unseeded} is VALID [2020-07-29 01:34:48,302 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#unseeded} havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {22#unseeded} is VALID [2020-07-29 01:34:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:48,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:34:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:48,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:48,374 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:48,410 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:48,491 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#(>= oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))))} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {243#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (or (not |ULTIMATE.start_test_fun_#t~short10|) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (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:48,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {243#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (or (not |ULTIMATE.start_test_fun_#t~short10|) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))))} assume test_fun_#t~short10; {247#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (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:48,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {247#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {247#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (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:48,496 INFO L280 TraceCheckUtils]: 3: Hoare triple {247#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; {235#(or (and (> oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:34:48,497 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:48,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:34:48,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:48,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:48,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,540 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:34:48,542 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2020-07-29 01:34:48,773 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 60 states and 79 transitions. Complement of second has 10 states. [2020-07-29 01:34:48,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:48,774 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:48,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:34:48,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:48,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:48,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:48,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:34:48,783 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:34:48,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:48,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:48,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 79 transitions. [2020-07-29 01:34:48,787 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-07-29 01:34:48,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:48,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:48,789 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states. [2020-07-29 01:34:48,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:48,793 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:34:48,793 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:34:48,796 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:34:48,796 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:48,796 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 79 transitions. cyclomatic complexity: 23 [2020-07-29 01:34:48,801 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2020-07-29 01:34:48,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:48,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:48,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:48,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:48,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:48,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:48,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:34:48,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:34:48,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:34:48,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 60 letters. Loop has 60 letters. [2020-07-29 01:34:48,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 60 letters. Loop has 60 letters. [2020-07-29 01:34:48,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 60 letters. Loop has 60 letters. [2020-07-29 01:34:48,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:34:48,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:34:48,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:34:48,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:48,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:48,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:48,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:48,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:48,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:48,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:48,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:48,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:48,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:34:48,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:34:48,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:34:48,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:48,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:48,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:48,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:48,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:48,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:48,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:48,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:48,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:48,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:48,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:48,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:48,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:34:48,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:34:48,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:34:48,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:48,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:48,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:48,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:34:48,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:34:48,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:34:48,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 11 letters. Loop has 5 letters. [2020-07-29 01:34:48,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 5 letters. [2020-07-29 01:34:48,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 11 letters. Loop has 5 letters. [2020-07-29 01:34:48,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:48,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:48,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:48,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:34:48,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:34:48,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:34:48,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:34:48,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:34:48,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:34:48,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:34:48,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:34:48,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:34:48,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:34:48,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:34:48,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:34:48,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:34:48,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:34:48,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:34:48,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:48,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:48,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:48,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:48,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:48,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:48,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:48,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:48,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:48,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:34:48,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:34:48,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:34:48,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:48,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:48,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:48,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,829 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:34:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2020-07-29 01:34:48,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:48,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:48,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:34:48,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:48,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. cyclomatic complexity: 23 [2020-07-29 01:34:48,842 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-07-29 01:34:48,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 30 states and 45 transitions. [2020-07-29 01:34:48,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 01:34:48,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-07-29 01:34:48,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2020-07-29 01:34:48,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:48,857 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2020-07-29 01:34:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2020-07-29 01:34:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-29 01:34:48,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:48,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 45 transitions. Second operand 29 states. [2020-07-29 01:34:48,887 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 45 transitions. Second operand 29 states. [2020-07-29 01:34:48,889 INFO L87 Difference]: Start difference. First operand 30 states and 45 transitions. Second operand 29 states. [2020-07-29 01:34:48,892 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:48,896 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. [2020-07-29 01:34:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 45 transitions. [2020-07-29 01:34:48,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:48,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:48,898 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states and 45 transitions. [2020-07-29 01:34:48,898 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states and 45 transitions. [2020-07-29 01:34:48,899 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:48,902 INFO L93 Difference]: Finished difference Result 31 states and 47 transitions. [2020-07-29 01:34:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2020-07-29 01:34:48,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:48,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:48,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:48,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 01:34:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2020-07-29 01:34:48,906 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2020-07-29 01:34:48,906 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2020-07-29 01:34:48,907 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:34:48,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2020-07-29 01:34:48,907 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-07-29 01:34:48,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:48,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:48,908 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:48,908 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:48,908 INFO L794 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 328#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 329#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 348#L557-1 [2020-07-29 01:34:48,909 INFO L796 eck$LassoCheckResult]: Loop: 348#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 345#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 346#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 342#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 348#L557-1 [2020-07-29 01:34:48,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:48,909 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-07-29 01:34:48,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:48,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774343581] [2020-07-29 01:34:48,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:48,939 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:48,963 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:48,970 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:48,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:48,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1298969, now seen corresponding path program 1 times [2020-07-29 01:34:48,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:48,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498312769] [2020-07-29 01:34:48,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:48,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:49,004 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:49,010 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:49,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1806908732, now seen corresponding path program 1 times [2020-07-29 01:34:49,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:49,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877269048] [2020-07-29 01:34:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:49,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {474#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {474#true} is VALID [2020-07-29 01:34:49,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {474#true} havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {474#true} is VALID [2020-07-29 01:34:49,141 INFO L280 TraceCheckUtils]: 2: Hoare triple {474#true} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {476#(or |ULTIMATE.start_test_fun_#t~short10| (<= (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))} is VALID [2020-07-29 01:34:49,143 INFO L280 TraceCheckUtils]: 3: Hoare triple {476#(or |ULTIMATE.start_test_fun_#t~short10| (<= (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))} assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; {477#(<= (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))} is VALID [2020-07-29 01:34:49,145 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#(<= (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))} assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {478#(<= |ULTIMATE.start_test_fun_#t~mem11| |ULTIMATE.start_test_fun_#t~mem12|)} is VALID [2020-07-29 01:34:49,146 INFO L280 TraceCheckUtils]: 5: Hoare triple {478#(<= |ULTIMATE.start_test_fun_#t~mem11| |ULTIMATE.start_test_fun_#t~mem12|)} assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; {475#false} is VALID [2020-07-29 01:34:49,146 INFO L280 TraceCheckUtils]: 6: Hoare triple {475#false} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {475#false} is VALID [2020-07-29 01:34:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:49,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877269048] [2020-07-29 01:34:49,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:49,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:34:49,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264452249] [2020-07-29 01:34:49,354 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2020-07-29 01:34:49,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:49,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:34:49,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:34:49,453 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 18 Second operand 5 states. [2020-07-29 01:34:49,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:49,612 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2020-07-29 01:34:49,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:34:49,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:34:49,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:49,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 65 transitions. [2020-07-29 01:34:49,630 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2020-07-29 01:34:49,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 51 transitions. [2020-07-29 01:34:49,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-07-29 01:34:49,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-07-29 01:34:49,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 51 transitions. [2020-07-29 01:34:49,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:49,633 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2020-07-29 01:34:49,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 51 transitions. [2020-07-29 01:34:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2020-07-29 01:34:49,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:49,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 51 transitions. Second operand 19 states. [2020-07-29 01:34:49,636 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 51 transitions. Second operand 19 states. [2020-07-29 01:34:49,636 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 19 states. [2020-07-29 01:34:49,637 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:49,639 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2020-07-29 01:34:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2020-07-29 01:34:49,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:49,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:49,640 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 36 states and 51 transitions. [2020-07-29 01:34:49,640 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 36 states and 51 transitions. [2020-07-29 01:34:49,641 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:49,644 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2020-07-29 01:34:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2020-07-29 01:34:49,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:49,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:49,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:49,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:34:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2020-07-29 01:34:49,647 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2020-07-29 01:34:49,647 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2020-07-29 01:34:49,647 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:34:49,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2020-07-29 01:34:49,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 01:34:49,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:49,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:49,648 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:49,648 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:34:49,648 INFO L794 eck$LassoCheckResult]: Stem: 534#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 527#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 528#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 535#L557-1 [2020-07-29 01:34:49,649 INFO L796 eck$LassoCheckResult]: Loop: 535#L557-1 assume test_fun_#t~short10; 536#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 529#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 530#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 540#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 535#L557-1 [2020-07-29 01:34:49,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:49,649 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2020-07-29 01:34:49,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:49,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293212763] [2020-07-29 01:34:49,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:49,673 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:49,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:49,711 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:49,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:49,713 INFO L82 PathProgramCache]: Analyzing trace with hash 38423577, now seen corresponding path program 1 times [2020-07-29 01:34:49,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:49,717 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205760147] [2020-07-29 01:34:49,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:49,738 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:49,752 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:49,755 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:49,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:49,759 INFO L82 PathProgramCache]: Analyzing trace with hash 177751382, now seen corresponding path program 1 times [2020-07-29 01:34:49,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:49,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371353583] [2020-07-29 01:34:49,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:49,852 INFO L280 TraceCheckUtils]: 0: Hoare triple {684#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {684#true} is VALID [2020-07-29 01:34:49,852 INFO L280 TraceCheckUtils]: 1: Hoare triple {684#true} havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {684#true} is VALID [2020-07-29 01:34:49,854 INFO L280 TraceCheckUtils]: 2: Hoare triple {684#true} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {686#(or (not |ULTIMATE.start_test_fun_#t~short10|) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (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:49,855 INFO L280 TraceCheckUtils]: 3: Hoare triple {686#(or (not |ULTIMATE.start_test_fun_#t~short10|) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} assume test_fun_#t~short10; {687#(<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (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:49,856 INFO L280 TraceCheckUtils]: 4: Hoare triple {687#(<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {688#(<= (+ |ULTIMATE.start_test_fun_#t~mem12| 1) |ULTIMATE.start_test_fun_#t~mem11|)} is VALID [2020-07-29 01:34:49,857 INFO L280 TraceCheckUtils]: 5: Hoare triple {688#(<= (+ |ULTIMATE.start_test_fun_#t~mem12| 1) |ULTIMATE.start_test_fun_#t~mem11|)} assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {685#false} is VALID [2020-07-29 01:34:49,857 INFO L280 TraceCheckUtils]: 6: Hoare triple {685#false} assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; {685#false} is VALID [2020-07-29 01:34:49,858 INFO L280 TraceCheckUtils]: 7: Hoare triple {685#false} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {685#false} is VALID [2020-07-29 01:34:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:49,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371353583] [2020-07-29 01:34:49,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:49,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:34:49,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084163418] [2020-07-29 01:34:49,989 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2020-07-29 01:34:50,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:50,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:34:50,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:34:50,062 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-07-29 01:34:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:50,169 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2020-07-29 01:34:50,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:34:50,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:34:50,194 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:50,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2020-07-29 01:34:50,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:34:50,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 20 transitions. [2020-07-29 01:34:50,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:34:50,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:34:50,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2020-07-29 01:34:50,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:50,203 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 01:34:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2020-07-29 01:34:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 01:34:50,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:50,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 20 transitions. Second operand 16 states. [2020-07-29 01:34:50,205 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 20 transitions. Second operand 16 states. [2020-07-29 01:34:50,205 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 16 states. [2020-07-29 01:34:50,206 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:50,208 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2020-07-29 01:34:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-07-29 01:34:50,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:50,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:50,209 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states and 20 transitions. [2020-07-29 01:34:50,209 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states and 20 transitions. [2020-07-29 01:34:50,210 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:50,212 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2020-07-29 01:34:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-07-29 01:34:50,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:50,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:50,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:50,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:34:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-07-29 01:34:50,215 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 01:34:50,215 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 01:34:50,215 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:34:50,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-07-29 01:34:50,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:34:50,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:50,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:50,216 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:50,216 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:34:50,217 INFO L794 eck$LassoCheckResult]: Stem: 715#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 709#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 710#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 716#L557-1 [2020-07-29 01:34:50,217 INFO L796 eck$LassoCheckResult]: Loop: 716#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 717#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 722#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 720#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 721#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 716#L557-1 [2020-07-29 01:34:50,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:50,217 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2020-07-29 01:34:50,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:50,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601960827] [2020-07-29 01:34:50,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:50,240 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:50,257 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:50,261 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:50,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:50,262 INFO L82 PathProgramCache]: Analyzing trace with hash 40270619, now seen corresponding path program 1 times [2020-07-29 01:34:50,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:50,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150418504] [2020-07-29 01:34:50,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:50,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {806#true} assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; {808#(or (not |ULTIMATE.start_test_fun_#t~short10|) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} is VALID [2020-07-29 01:34:50,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {808#(or (not |ULTIMATE.start_test_fun_#t~short10|) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {809#(<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:34:50,324 INFO L280 TraceCheckUtils]: 2: Hoare triple {809#(<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {810#(<= (+ |ULTIMATE.start_test_fun_#t~mem15| 1) |ULTIMATE.start_test_fun_#t~mem14|)} is VALID [2020-07-29 01:34:50,325 INFO L280 TraceCheckUtils]: 3: Hoare triple {810#(<= (+ |ULTIMATE.start_test_fun_#t~mem15| 1) |ULTIMATE.start_test_fun_#t~mem14|)} assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; {807#false} is VALID [2020-07-29 01:34:50,325 INFO L280 TraceCheckUtils]: 4: Hoare triple {807#false} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {807#false} is VALID [2020-07-29 01:34:50,325 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:50,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150418504] [2020-07-29 01:34:50,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:50,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:34:50,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299490808] [2020-07-29 01:34:50,327 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:50,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:50,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:34:50,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:34:50,328 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-07-29 01:34:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:50,443 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-07-29 01:34:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:34:50,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:34:50,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:50,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2020-07-29 01:34:50,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:34:50,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 18 transitions. [2020-07-29 01:34:50,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:34:50,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:34:50,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2020-07-29 01:34:50,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:50,457 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-07-29 01:34:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2020-07-29 01:34:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-29 01:34:50,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:50,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 18 transitions. Second operand 15 states. [2020-07-29 01:34:50,459 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 18 transitions. Second operand 15 states. [2020-07-29 01:34:50,459 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 15 states. [2020-07-29 01:34:50,460 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:50,463 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-07-29 01:34:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2020-07-29 01:34:50,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:50,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:50,464 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states and 18 transitions. [2020-07-29 01:34:50,464 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states and 18 transitions. [2020-07-29 01:34:50,464 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:50,468 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-07-29 01:34:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2020-07-29 01:34:50,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:50,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:50,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:50,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:50,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:34:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2020-07-29 01:34:50,470 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-07-29 01:34:50,470 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-07-29 01:34:50,470 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:34:50,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2020-07-29 01:34:50,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:34:50,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:50,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:50,471 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:34:50,471 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:34:50,472 INFO L794 eck$LassoCheckResult]: Stem: 834#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 828#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 829#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 835#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 836#L557-3 [2020-07-29 01:34:50,472 INFO L796 eck$LassoCheckResult]: Loop: 836#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 840#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 839#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 831#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 841#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 836#L557-3 [2020-07-29 01:34:50,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:50,472 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2020-07-29 01:34:50,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:50,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713106777] [2020-07-29 01:34:50,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:50,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:50,512 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:50,517 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:50,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:50,517 INFO L82 PathProgramCache]: Analyzing trace with hash 45962937, now seen corresponding path program 1 times [2020-07-29 01:34:50,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:50,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946883329] [2020-07-29 01:34:50,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:50,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:50,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:50,542 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:50,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:50,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581938, now seen corresponding path program 1 times [2020-07-29 01:34:50,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:50,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287832204] [2020-07-29 01:34:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:50,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:50,624 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:50,632 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:50,881 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2020-07-29 01:34:52,045 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 157 DAG size of output: 128 [2020-07-29 01:34:52,397 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-07-29 01:34:52,402 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:52,402 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:52,402 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:52,402 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:52,402 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:52,402 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:52,403 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:52,403 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:52,403 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.13-alloca.i_Iteration5_Lasso [2020-07-29 01:34:52,403 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:52,403 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:52,457 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:54,037 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 126 DAG size of output: 110 [2020-07-29 01:34:54,300 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2020-07-29 01:34:54,313 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:54,316 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:54,322 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:54,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:54,329 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:54,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:54,339 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:54,342 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:54,345 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:54,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:54,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:54,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:54,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:54,373 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:54,377 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:54,885 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2020-07-29 01:34:55,091 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-07-29 01:34:55,857 WARN L193 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-07-29 01:34:56,101 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2020-07-29 01:34:56,460 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:56,460 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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:56,472 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:56,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:56,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:56,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:56,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:56,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:56,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:56,479 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:34:56,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:56,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:56,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:56,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:56,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:56,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:56,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:56,517 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:34:56,543 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:56,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:56,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:56,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:56,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:56,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:56,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:56,551 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) [2020-07-29 01:34:56,591 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:56,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:56,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:56,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:56,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:56,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:56,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:56,599 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:34:56,627 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:56,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:56,629 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:34:56,629 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:34:56,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:56,661 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-07-29 01:34:56,661 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:34:56,745 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:56,820 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 01:34:56,821 INFO L444 ModelExtractionUtils]: 83 out of 91 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:56,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:56,828 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-07-29 01:34:56,828 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:56,829 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_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*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_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 [] [2020-07-29 01:34:57,129 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2020-07-29 01:34:57,134 INFO L393 LassoCheck]: Loop: "assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);" "assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);" "assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16;" "call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7;" "assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9;" [2020-07-29 01:34:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:57,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:57,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:57,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:57,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:57,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:57,185 INFO L280 TraceCheckUtils]: 0: Hoare triple {920#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {920#unseeded} is VALID [2020-07-29 01:34:57,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {920#unseeded} havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {920#unseeded} is VALID [2020-07-29 01:34:57,186 INFO L280 TraceCheckUtils]: 2: Hoare triple {920#unseeded} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {920#unseeded} is VALID [2020-07-29 01:34:57,187 INFO L280 TraceCheckUtils]: 3: Hoare triple {920#unseeded} assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; {920#unseeded} is VALID [2020-07-29 01:34:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:57,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:34:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:57,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:57,627 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2020-07-29 01:34:57,629 INFO L350 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-07-29 01:34:57,629 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 113 [2020-07-29 01:34:57,693 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:57,704 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:57,721 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:57,743 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:57,753 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:57,764 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:57,796 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:57,815 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:57,960 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2020-07-29 01:34:57,962 INFO L624 ElimStorePlain]: treesize reduction 313, result has 46.9 percent of original size [2020-07-29 01:34:57,968 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:57,979 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:57,984 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2020-07-29 01:34:57,984 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:277 [2020-07-29 01:35:10,057 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:10,058 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_114|, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_~z_ref~0.offset]. (let ((.cse3 (select |v_#memory_int_114| ULTIMATE.start_test_fun_~y_ref~0.base))) (let ((.cse0 (select (select |v_#memory_int_114| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (.cse1 (select .cse3 ULTIMATE.start_test_fun_~y_ref~0.offset)) (.cse2 (select (select |v_#memory_int_114| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (<= (+ .cse0 1) .cse1) (<= .cse2 .cse0) (= (store |v_#memory_int_114| ULTIMATE.start_test_fun_~y_ref~0.base (store .cse3 ULTIMATE.start_test_fun_~y_ref~0.offset (+ .cse1 (- 1)))) |#memory_int|) (<= .cse1 (+ oldRank0 .cse2))))) [2020-07-29 01:35:10,058 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_~z_ref~0.offset, v_prenex_2, v_prenex_1, v_prenex_6, v_prenex_4, v_prenex_3, v_prenex_5]. (let ((.cse2 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (let ((.cse4 (+ .cse2 1)) (.cse6 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (let ((.cse0 (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (.cse5 (<= .cse4 (+ .cse6 oldRank0))) (.cse3 (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))) (or (and (not .cse0) (or (let ((.cse1 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (and (<= .cse1 .cse2) (not (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~z_ref~0.offset)) (or (and .cse3 (<= .cse4 (+ oldRank0 .cse1)) .cse0) (and .cse5 (<= .cse6 .cse1))))) (let ((.cse7 (select (select |#memory_int| v_prenex_2) v_prenex_1))) (and (<= .cse7 .cse2) (or (and .cse3 (<= .cse4 (+ oldRank0 .cse7)) .cse0) (and .cse5 (<= .cse6 .cse7))) (not (= ULTIMATE.start_test_fun_~y_ref~0.base v_prenex_2)))))) (and (or (let ((.cse8 (select (select |#memory_int| v_prenex_6) v_prenex_4))) (and (<= .cse8 .cse2) (not (= ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_4)) (or (and .cse3 (<= .cse4 (+ oldRank0 .cse8)) .cse0) (and .cse5 (<= .cse6 .cse8))))) (let ((.cse9 (select (select |#memory_int| v_prenex_3) v_prenex_5))) (and (<= .cse9 .cse2) (or (and .cse3 (<= .cse4 (+ oldRank0 .cse9)) .cse0) (and .cse5 (<= .cse6 .cse9))) (not (= ULTIMATE.start_test_fun_~y_ref~0.base v_prenex_3))))) (not .cse3)))))) [2020-07-29 01:35:10,074 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:10,088 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:10,114 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:10,134 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:10,376 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:10,397 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:10,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {923#(>= oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))))} assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {1152#(and (<= (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)) (<= (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~mem11|) (<= |ULTIMATE.start_test_fun_#t~mem12| (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))} is VALID [2020-07-29 01:35:10,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {1152#(and (<= (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)) (<= (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~mem11|) (<= |ULTIMATE.start_test_fun_#t~mem12| (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))} assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {1156#(and (<= (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)) (exists ((ULTIMATE.start_test_fun_~z_ref~0.offset Int) (ULTIMATE.start_test_fun_~z_ref~0.base Int)) (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem15|))) (<= |ULTIMATE.start_test_fun_#t~mem14| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} is VALID [2020-07-29 01:35:10,493 INFO L280 TraceCheckUtils]: 2: Hoare triple {1156#(and (<= (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)) (exists ((ULTIMATE.start_test_fun_~z_ref~0.offset Int) (ULTIMATE.start_test_fun_~z_ref~0.base Int)) (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem15|))) (<= |ULTIMATE.start_test_fun_#t~mem14| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; {1160#(or (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= ULTIMATE.start_test_fun_~y_ref~0.base v_prenex_2)) (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| v_prenex_2) v_prenex_1)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0))) (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= 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 (select (select |#memory_int| v_prenex_2) v_prenex_1)))))))) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int)) (and (not (= ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_4)) (<= (select (select |#memory_int| v_prenex_6) v_prenex_4) (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) (+ (select (select |#memory_int| v_prenex_6) v_prenex_4) oldRank0)) (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (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| v_prenex_6) v_prenex_4)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (+ (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_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))))} is VALID [2020-07-29 01:35:10,494 INFO L280 TraceCheckUtils]: 3: Hoare triple {1160#(or (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= ULTIMATE.start_test_fun_~y_ref~0.base v_prenex_2)) (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| v_prenex_2) v_prenex_1)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0))) (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= 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 (select (select |#memory_int| v_prenex_2) v_prenex_1)))))))) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int)) (and (not (= ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_4)) (<= (select (select |#memory_int| v_prenex_6) v_prenex_4) (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) (+ (select (select |#memory_int| v_prenex_6) v_prenex_4) oldRank0)) (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (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| v_prenex_6) v_prenex_4)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (+ (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_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))))} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {1160#(or (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= ULTIMATE.start_test_fun_~y_ref~0.base v_prenex_2)) (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| v_prenex_2) v_prenex_1)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0))) (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= 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 (select (select |#memory_int| v_prenex_2) v_prenex_1)))))))) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int)) (and (not (= ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_4)) (<= (select (select |#memory_int| v_prenex_6) v_prenex_4) (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) (+ (select (select |#memory_int| v_prenex_6) v_prenex_4) oldRank0)) (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (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| v_prenex_6) v_prenex_4)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (+ (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_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))))} is VALID [2020-07-29 01:35:10,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {1160#(or (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= ULTIMATE.start_test_fun_~y_ref~0.base v_prenex_2)) (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| v_prenex_2) v_prenex_1)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0))) (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= 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 (select (select |#memory_int| v_prenex_2) v_prenex_1)))))))) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int)) (and (not (= ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_4)) (<= (select (select |#memory_int| v_prenex_6) v_prenex_4) (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) (+ (select (select |#memory_int| v_prenex_6) v_prenex_4) oldRank0)) (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (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| v_prenex_6) v_prenex_4)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (+ (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_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))))} assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; {1138#(or (and (>= oldRank0 0) (> oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))))) unseeded)} is VALID [2020-07-29 01:35:10,497 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:10,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:35:10,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:10,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:10,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,519 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:35:10,519 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-07-29 01:35:10,657 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 30 states and 35 transitions. Complement of second has 9 states. [2020-07-29 01:35:10,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:10,660 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:10,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. cyclomatic complexity: 5 [2020-07-29 01:35:10,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:10,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:10,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:35:10,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:35:10,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:10,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:10,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2020-07-29 01:35:10,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:35:10,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:10,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:10,664 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 18 transitions. cyclomatic complexity: 5 [2020-07-29 01:35:10,671 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:35:10,671 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:35:10,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:35:10,672 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:10,672 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 35 transitions. cyclomatic complexity: 8 [2020-07-29 01:35:10,675 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:35:10,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:10,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:10,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:10,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:10,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:10,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:10,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:10,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:10,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:10,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:10,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:10,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:10,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:35:10,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:35:10,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:35:10,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:10,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:10,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:10,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:10,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:10,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:10,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:35:10,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:35:10,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:35:10,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:10,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:10,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:10,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:35:10,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:35:10,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:35:10,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:35:10,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:35:10,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:35:10,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:10,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:10,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:10,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:35:10,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:35:10,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:35:10,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:10,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:10,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:10,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:10,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:10,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:10,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:35:10,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:35:10,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:35:10,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:35:10,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:35:10,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:35:10,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 5 letters. [2020-07-29 01:35:10,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 5 letters. [2020-07-29 01:35:10,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 5 letters. [2020-07-29 01:35:10,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:35:10,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:35:10,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:35:10,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 5 letters. [2020-07-29 01:35:10,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 5 letters. [2020-07-29 01:35:10,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 5 letters. [2020-07-29 01:35:10,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 5 letters. [2020-07-29 01:35:10,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 5 letters. [2020-07-29 01:35:10,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 5 letters. [2020-07-29 01:35:10,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,694 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:35:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-07-29 01:35:10,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:35:10,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:10,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 10 letters. [2020-07-29 01:35:10,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. cyclomatic complexity: 8 [2020-07-29 01:35:10,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:35:10,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2020-07-29 01:35:10,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:35:10,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 01:35:10,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-07-29 01:35:10,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:10,699 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-29 01:35:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-07-29 01:35:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-07-29 01:35:10,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:10,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 28 transitions. Second operand 22 states. [2020-07-29 01:35:10,704 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 28 transitions. Second operand 22 states. [2020-07-29 01:35:10,704 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 22 states. [2020-07-29 01:35:10,704 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:10,706 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-29 01:35:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-29 01:35:10,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:10,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:10,707 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states and 28 transitions. [2020-07-29 01:35:10,707 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states and 28 transitions. [2020-07-29 01:35:10,707 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:10,709 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-29 01:35:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-29 01:35:10,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:10,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:10,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:10,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:35:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-07-29 01:35:10,710 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-29 01:35:10,710 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-29 01:35:10,710 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:35:10,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2020-07-29 01:35:10,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:35:10,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:10,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:10,711 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:10,712 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:35:10,712 INFO L794 eck$LassoCheckResult]: Stem: 1216#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1210#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1211#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 1224#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 1227#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 1225#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 1222#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 1223#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 1217#L557-1 assume test_fun_#t~short10; 1218#L557-3 [2020-07-29 01:35:10,712 INFO L796 eck$LassoCheckResult]: Loop: 1218#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 1212#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 1213#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 1231#L557-1 assume test_fun_#t~short10; 1218#L557-3 [2020-07-29 01:35:10,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:10,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581936, now seen corresponding path program 1 times [2020-07-29 01:35:10,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:10,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593610978] [2020-07-29 01:35:10,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:10,840 INFO L280 TraceCheckUtils]: 0: Hoare triple {1335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1335#true} is VALID [2020-07-29 01:35:10,844 INFO L280 TraceCheckUtils]: 1: Hoare triple {1335#true} havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {1337#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:35:10,846 INFO L280 TraceCheckUtils]: 2: Hoare triple {1337#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {1338#(and (or (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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) |ULTIMATE.start_test_fun_#t~short10|) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:35:10,847 INFO L280 TraceCheckUtils]: 3: Hoare triple {1338#(and (or (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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) |ULTIMATE.start_test_fun_#t~short10|) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; {1339#(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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:35:10,849 INFO L280 TraceCheckUtils]: 4: Hoare triple {1339#(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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {1339#(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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:35:10,850 INFO L280 TraceCheckUtils]: 5: Hoare triple {1339#(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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {1339#(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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:35:10,852 INFO L280 TraceCheckUtils]: 6: Hoare triple {1339#(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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; {1340#(<= (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))} is VALID [2020-07-29 01:35:10,854 INFO L280 TraceCheckUtils]: 7: Hoare triple {1340#(<= (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {1341#(not |ULTIMATE.start_test_fun_#t~short10|)} is VALID [2020-07-29 01:35:10,855 INFO L280 TraceCheckUtils]: 8: Hoare triple {1341#(not |ULTIMATE.start_test_fun_#t~short10|)} assume test_fun_#t~short10; {1336#false} is VALID [2020-07-29 01:35:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:10,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593610978] [2020-07-29 01:35:10,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570694860] [2020-07-29 01:35:10,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:35:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:10,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-29 01:35:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:10,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:10,957 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:10,958 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2020-07-29 01:35:10,960 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:10,966 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:10,967 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:35:10,967 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2020-07-29 01:35:10,970 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:10,970 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_150|]. (let ((.cse0 (store |v_#valid_150| ULTIMATE.start_test_fun_~x_ref~0.base 1))) (and (= (select (store .cse0 ULTIMATE.start_test_fun_~y_ref~0.base 1) ULTIMATE.start_test_fun_~z_ref~0.base) 0) (= 0 (select .cse0 ULTIMATE.start_test_fun_~y_ref~0.base)))) [2020-07-29 01:35:10,970 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base))) [2020-07-29 01:35:11,039 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:11,070 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:11,230 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2020-07-29 01:35:11,233 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:11,244 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:11,259 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:35:11,259 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2020-07-29 01:35:23,789 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:23,790 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_115|, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~y_ref~0.offset]. (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (= (store |v_#memory_int_115| ULTIMATE.start_test_fun_~y_ref~0.base (let ((.cse0 (select |v_#memory_int_115| ULTIMATE.start_test_fun_~y_ref~0.base))) (store .cse0 ULTIMATE.start_test_fun_~y_ref~0.offset (+ (select .cse0 ULTIMATE.start_test_fun_~y_ref~0.offset) (- 1))))) |#memory_int|) (<= (select (select |v_#memory_int_115| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |v_#memory_int_115| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base))) [2020-07-29 01:35:23,790 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (<= (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) [2020-07-29 01:35:24,046 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:24,094 INFO L280 TraceCheckUtils]: 0: Hoare triple {1335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1335#true} is VALID [2020-07-29 01:35:24,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {1335#true} havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {1348#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:35:24,100 INFO L280 TraceCheckUtils]: 2: Hoare triple {1348#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {1352#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (or |ULTIMATE.start_test_fun_#t~short10| (<= (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:35:24,101 INFO L280 TraceCheckUtils]: 3: Hoare triple {1352#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (or |ULTIMATE.start_test_fun_#t~short10| (<= (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; {1356#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:35:24,102 INFO L280 TraceCheckUtils]: 4: Hoare triple {1356#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {1356#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:35:24,104 INFO L280 TraceCheckUtils]: 5: Hoare triple {1356#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {1356#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} is VALID [2020-07-29 01:35:24,106 INFO L280 TraceCheckUtils]: 6: Hoare triple {1356#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)))} assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; {1366#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (<= (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))} is VALID [2020-07-29 01:35:24,107 INFO L280 TraceCheckUtils]: 7: Hoare triple {1366#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base)) (<= (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; {1341#(not |ULTIMATE.start_test_fun_#t~short10|)} is VALID [2020-07-29 01:35:24,110 INFO L280 TraceCheckUtils]: 8: Hoare triple {1341#(not |ULTIMATE.start_test_fun_#t~short10|)} assume test_fun_#t~short10; {1336#false} is VALID [2020-07-29 01:35:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:24,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:35:24,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-07-29 01:35:24,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277593810] [2020-07-29 01:35:24,111 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:35:24,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:24,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1480167, now seen corresponding path program 2 times [2020-07-29 01:35:24,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:24,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324875296] [2020-07-29 01:35:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:24,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:24,120 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:24,122 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:24,255 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2020-07-29 01:35:24,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:24,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:35:24,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:35:24,305 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand 11 states. [2020-07-29 01:35:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:24,556 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-29 01:35:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:35:24,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:35:24,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:24,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-07-29 01:35:24,606 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:24,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2020-07-29 01:35:24,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:35:24,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:35:24,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:35:24,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:24,608 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:24,608 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:24,608 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:24,608 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:35:24,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:35:24,609 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:24,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:24,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:35:24 BoogieIcfgContainer [2020-07-29 01:35:24,615 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:35:24,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:35:24,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:35:24,616 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:35:24,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:41" (3/4) ... [2020-07-29 01:35:24,620 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:35:24,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:35:24,622 INFO L168 Benchmark]: Toolchain (without parser) took 43891.29 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.5 MB). Free memory was 961.6 MB in the beginning and 882.8 MB in the end (delta: 78.8 MB). Peak memory consumption was 445.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,622 INFO L168 Benchmark]: CDTParser took 0.40 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:24,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 602.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,624 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.74 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,624 INFO L168 Benchmark]: Boogie Preprocessor took 33.21 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:24,625 INFO L168 Benchmark]: RCFGBuilder took 475.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,625 INFO L168 Benchmark]: BuchiAutomizer took 42708.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.3 MB). Free memory was 1.1 GB in the beginning and 882.8 MB in the end (delta: 187.8 MB). Peak memory consumption was 421.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,626 INFO L168 Benchmark]: Witness Printer took 4.39 ms. Allocated memory is still 1.4 GB. Free memory is still 882.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:24,629 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.40 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 602.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.74 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.21 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 475.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 42708.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.3 MB). Free memory was 1.1 GB in the beginning and 882.8 MB in the end (delta: 187.8 MB). Peak memory consumption was 421.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.39 ms. Allocated memory is still 1.4 GB. Free memory is still 882.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 42.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 27.4s. Construction of modules took 0.3s. Büchi inclusion checks took 14.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 39 SDtfs, 64 SDslu, 39 SDs, 0 SdLazy, 143 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital415 mio100 ax104 hnf99 lsp95 ukn74 mio100 lsp30 div100 bol104 ite100 ukn100 eq182 hnf88 smp93 dnf231 smp73 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 204ms VariablesStem: 17 VariablesLoop: 12 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...