./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.06-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/a.06-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 e6c4332f1874752b59e29803328ba77ee4005585 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: No Interpolants --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:33:52,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:33:52,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:33:52,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:33:52,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:33:52,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:33:52,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:33:52,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:33:52,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:33:52,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:33:52,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:33:52,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:33:52,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:33:52,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:33:52,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:33:52,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:33:52,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:33:52,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:33:52,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:33:52,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:33:52,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:33:52,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:33:52,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:33:52,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:33:52,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:33:52,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:33:52,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:33:52,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:33:52,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:33:52,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:33:52,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:33:52,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:33:52,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:33:52,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:33:52,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:33:52,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:33:52,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:33:52,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:33:52,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:33:52,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:33:52,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:33:52,755 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:33:52,771 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:33:52,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:33:52,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:33:52,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:33:52,773 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:33:52,773 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:33:52,774 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:33:52,774 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:33:52,774 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:33:52,774 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:33:52,774 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:33:52,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:33:52,775 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:33:52,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:33:52,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:33:52,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:33:52,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:33:52,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:33:52,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:33:52,776 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:33:52,777 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:33:52,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:33:52,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:33:52,777 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:33:52,778 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:33:52,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:33:52,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:33:52,778 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:33:52,779 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:33:52,780 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:33:52,780 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 -> e6c4332f1874752b59e29803328ba77ee4005585 [2020-07-29 01:33:53,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:33:53,090 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:33:53,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:33:53,095 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:33:53,096 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:33:53,097 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2020-07-29 01:33:53,167 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aed952af/b048af93ac4441c0bc72193de3ab5412/FLAG8f13f6906 [2020-07-29 01:33:53,640 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:33:53,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2020-07-29 01:33:53,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aed952af/b048af93ac4441c0bc72193de3ab5412/FLAG8f13f6906 [2020-07-29 01:33:53,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aed952af/b048af93ac4441c0bc72193de3ab5412 [2020-07-29 01:33:53,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:33:53,981 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:33:53,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:33:53,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:33:53,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:33:53,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:33:53" (1/1) ... [2020-07-29 01:33:53,991 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:33:53, skipping insertion in model container [2020-07-29 01:33:53,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:33:53" (1/1) ... [2020-07-29 01:33:54,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:33:54,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:33:54,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:33:54,531 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:33:54,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:33:54,657 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:33:54,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:54 WrapperNode [2020-07-29 01:33:54,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:33:54,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:33:54,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:33:54,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:33:54,668 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:33:54" (1/1) ... [2020-07-29 01:33:54,685 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:33:54" (1/1) ... [2020-07-29 01:33:54,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:33:54,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:33:54,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:33:54,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:33:54,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:54" (1/1) ... [2020-07-29 01:33:54,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:54" (1/1) ... [2020-07-29 01:33:54,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:54" (1/1) ... [2020-07-29 01:33:54,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:54" (1/1) ... [2020-07-29 01:33:54,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:54" (1/1) ... [2020-07-29 01:33:54,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:54" (1/1) ... [2020-07-29 01:33:54,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:54" (1/1) ... [2020-07-29 01:33:54,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:33:54,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:33:54,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:33:54,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:33:54,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:54" (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:33:54,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:33:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:33:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:33:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:33:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:33:54,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:33:55,351 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:33:55,351 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:33:55,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:33:55 BoogieIcfgContainer [2020-07-29 01:33:55,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:33:55,356 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:33:55,356 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:33:55,359 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:33:55,360 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:33:55,361 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:33:53" (1/3) ... [2020-07-29 01:33:55,362 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@315ba2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:33:55, skipping insertion in model container [2020-07-29 01:33:55,362 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:33:55,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:54" (2/3) ... [2020-07-29 01:33:55,363 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@315ba2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:33:55, skipping insertion in model container [2020-07-29 01:33:55,363 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:33:55,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:33:55" (3/3) ... [2020-07-29 01:33:55,365 INFO L371 chiAutomizerObserver]: Analyzing ICFG a.06-alloca.i [2020-07-29 01:33:55,417 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:33:55,417 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:33:55,417 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:33:55,418 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:33:55,418 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:33:55,418 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:33:55,419 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:33:55,419 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:33:55,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-29 01:33:55,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:33:55,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:55,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:55,469 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:33:55,470 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:55,470 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:33:55,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-29 01:33:55,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:33:55,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:55,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:55,475 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:33:55,475 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:55,483 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, 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); 4#L557-20true [2020-07-29 01:33:55,484 INFO L796 eck$LassoCheckResult]: Loop: 4#L557-20true call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 7#L557-1true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 10#L557-3true test_fun_#t~short14 := test_fun_#t~short9; 13#L557-4true assume test_fun_#t~short14; 3#L557-9true test_fun_#t~short18 := test_fun_#t~short14; 5#L557-10true assume !test_fun_#t~short18; 8#L557-12true test_fun_#t~short20 := test_fun_#t~short18; 9#L557-13true assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 14#L557-15true test_fun_#t~short22 := test_fun_#t~short20; 16#L557-16true assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 20#L557-18true assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 4#L557-20true [2020-07-29 01:33:55,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:55,489 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:33:55,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:55,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064851789] [2020-07-29 01:33:55,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:55,677 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:55,755 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:55,779 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:55,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:55,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1442805661, now seen corresponding path program 1 times [2020-07-29 01:33:55,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:55,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671900203] [2020-07-29 01:33:55,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:55,867 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; {26#true} is VALID [2020-07-29 01:33:55,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; {26#true} is VALID [2020-07-29 01:33:55,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {26#true} test_fun_#t~short14 := test_fun_#t~short9; {26#true} is VALID [2020-07-29 01:33:55,869 INFO L280 TraceCheckUtils]: 3: Hoare triple {26#true} assume test_fun_#t~short14; {28#|ULTIMATE.start_test_fun_#t~short14|} is VALID [2020-07-29 01:33:55,871 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#|ULTIMATE.start_test_fun_#t~short14|} test_fun_#t~short18 := test_fun_#t~short14; {29#|ULTIMATE.start_test_fun_#t~short18|} is VALID [2020-07-29 01:33:55,872 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#|ULTIMATE.start_test_fun_#t~short18|} assume !test_fun_#t~short18; {27#false} is VALID [2020-07-29 01:33:55,872 INFO L280 TraceCheckUtils]: 6: Hoare triple {27#false} test_fun_#t~short20 := test_fun_#t~short18; {27#false} is VALID [2020-07-29 01:33:55,872 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#false} assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; {27#false} is VALID [2020-07-29 01:33:55,873 INFO L280 TraceCheckUtils]: 8: Hoare triple {27#false} test_fun_#t~short22 := test_fun_#t~short20; {27#false} is VALID [2020-07-29 01:33:55,873 INFO L280 TraceCheckUtils]: 9: Hoare triple {27#false} assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; {27#false} is VALID [2020-07-29 01:33:55,873 INFO L280 TraceCheckUtils]: 10: Hoare triple {27#false} assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; {27#false} is VALID [2020-07-29 01:33:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:33:55,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671900203] [2020-07-29 01:33:55,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:55,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:33:55,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469241761] [2020-07-29 01:33:55,885 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:33:55,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:55,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:33:55,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:33:55,904 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2020-07-29 01:33:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:56,074 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-07-29 01:33:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:33:56,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:33:56,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:56,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2020-07-29 01:33:56,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-07-29 01:33:56,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 30 transitions. [2020-07-29 01:33:56,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-07-29 01:33:56,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-07-29 01:33:56,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2020-07-29 01:33:56,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:56,117 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-07-29 01:33:56,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2020-07-29 01:33:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2020-07-29 01:33:56,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:56,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 30 transitions. Second operand 17 states. [2020-07-29 01:33:56,150 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 30 transitions. Second operand 17 states. [2020-07-29 01:33:56,152 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 17 states. [2020-07-29 01:33:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:56,155 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-07-29 01:33:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-29 01:33:56,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:56,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:56,157 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 22 states and 30 transitions. [2020-07-29 01:33:56,157 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 22 states and 30 transitions. [2020-07-29 01:33:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:56,160 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-07-29 01:33:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-29 01:33:56,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:56,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:56,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:56,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:33:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-07-29 01:33:56,165 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 01:33:56,166 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 01:33:56,166 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:33:56,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-07-29 01:33:56,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-07-29 01:33:56,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:56,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:56,168 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:33:56,168 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:56,168 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 68#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, 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); 61#L557-20 [2020-07-29 01:33:56,169 INFO L796 eck$LassoCheckResult]: Loop: 61#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 62#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 64#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 67#L557-4 assume test_fun_#t~short14; 59#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 60#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 63#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 65#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 66#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 70#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 72#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 61#L557-20 [2020-07-29 01:33:56,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:56,169 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-07-29 01:33:56,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:56,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955647838] [2020-07-29 01:33:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:56,212 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:56,242 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:56,249 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:56,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1500063963, now seen corresponding path program 1 times [2020-07-29 01:33:56,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:56,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521593772] [2020-07-29 01:33:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:56,271 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:56,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:56,297 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:56,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:56,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1876539869, now seen corresponding path program 1 times [2020-07-29 01:33:56,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:56,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233762274] [2020-07-29 01:33:56,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:56,402 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:56,443 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:56,452 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:56,906 WARN L193 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2020-07-29 01:33:57,753 WARN L193 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 106 [2020-07-29 01:33:58,185 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-07-29 01:33:58,202 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:33:58,203 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:33:58,203 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:33:58,203 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:33:58,204 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:33:58,204 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:58,204 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:33:58,204 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:33:58,205 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration2_Lasso [2020-07-29 01:33:58,205 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:33:58,205 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:33:58,271 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:33:58,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:33:58,291 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:33:58,295 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:33:58,298 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:33:58,303 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:33:58,307 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:33:58,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:33:58,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:33:58,347 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:33:58,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:33:58,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:33:58,357 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:33:59,069 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2020-07-29 01:33:59,293 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-07-29 01:33:59,305 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:33:59,308 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:33:59,311 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:33:59,315 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:33:59,320 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:33:59,324 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:33:59,328 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:33:59,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:33:59,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:33:59,338 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:33:59,341 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:33:59,346 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:33:59,349 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:33:59,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:33:59,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:33:59,361 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:33:59,920 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-07-29 01:34:00,814 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:00,819 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:00,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:00,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:00,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:00,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:00,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:00,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:00,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:00,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:00,839 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:00,869 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:00,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:00,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:00,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:00,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:00,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:00,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:00,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:00,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:00,940 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:00,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:00,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:00,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:00,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:00,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:00,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:00,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:00,950 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:00,993 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:00,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:00,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:00,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:00,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:00,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:00,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:00,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:01,002 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:01,028 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:01,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:01,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:01,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:01,032 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:01,056 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:01,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:01,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:01,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:01,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:01,085 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:01,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:01,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:01,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:01,095 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:01,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:01,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:01,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:01,132 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:01,166 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:01,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:01,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:01,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:01,172 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:01,201 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:01,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:01,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:01,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:01,205 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:01,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:01,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:01,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:01,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:01,245 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:01,276 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:01,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:01,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:01,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:01,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:01,305 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:01,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:01,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:01,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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:01,362 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:01,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:01,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:01,374 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) [2020-07-29 01:34:01,418 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:01,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:01,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:01,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:01,470 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:01,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:01,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:01,481 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:01,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:01,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:01,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:01,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:01,536 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:01,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:01,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:01,575 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:01,599 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:01,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:01,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:01,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:01,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:01,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:01,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:01,638 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:01,800 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 01:34:01,801 INFO L444 ModelExtractionUtils]: 13 out of 40 variables were initially zero. Simplification set additionally 24 variables to zero. 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:01,817 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:34:01,826 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:34:01,826 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:01,827 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2020-07-29 01:34:02,150 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2020-07-29 01:34:02,158 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0;" "assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7;" "test_fun_#t~short14 := test_fun_#t~short9;" "assume test_fun_#t~short14;" "test_fun_#t~short18 := test_fun_#t~short14;" "assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16;" "test_fun_#t~short20 := test_fun_#t~short18;" "assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647;" "test_fun_#t~short22 := test_fun_#t~short20;" "assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647;" "assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24;" [2020-07-29 01:34:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:02,185 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:02,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:02,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:02,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:02,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {129#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {129#unseeded} is VALID [2020-07-29 01:34:02,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {129#unseeded} havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, 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); {129#unseeded} is VALID [2020-07-29 01:34:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:02,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:34:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:02,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:02,372 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:02,521 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:02,571 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:02,657 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:02,790 INFO L280 TraceCheckUtils]: 0: Hoare triple {132#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 4294967293))} call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; {355#(and (or (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (not |ULTIMATE.start_test_fun_#t~short9|)) (<= 4294967293 (+ oldRank0 (* 2 (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:02,793 INFO L280 TraceCheckUtils]: 1: Hoare triple {355#(and (or (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (not |ULTIMATE.start_test_fun_#t~short9|)) (<= 4294967293 (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))))} assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; {359#(and (<= 4294967293 (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))) (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (or (not |ULTIMATE.start_test_fun_#t~short9|) (<= (+ (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646)))} is VALID [2020-07-29 01:34:02,795 INFO L280 TraceCheckUtils]: 2: Hoare triple {359#(and (<= 4294967293 (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))) (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (or (not |ULTIMATE.start_test_fun_#t~short9|) (<= (+ (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646)))} test_fun_#t~short14 := test_fun_#t~short9; {363#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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~short14|) (<= (+ (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646)))} is VALID [2020-07-29 01:34:02,797 INFO L280 TraceCheckUtils]: 3: Hoare triple {363#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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~short14|) (<= (+ (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646)))} assume test_fun_#t~short14; {367#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646))} is VALID [2020-07-29 01:34:02,798 INFO L280 TraceCheckUtils]: 4: Hoare triple {367#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646))} test_fun_#t~short18 := test_fun_#t~short14; {367#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646))} is VALID [2020-07-29 01:34:02,801 INFO L280 TraceCheckUtils]: 5: Hoare triple {367#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646))} assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; {367#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646))} is VALID [2020-07-29 01:34:02,802 INFO L280 TraceCheckUtils]: 6: Hoare triple {367#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646))} test_fun_#t~short20 := test_fun_#t~short18; {367#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646))} is VALID [2020-07-29 01:34:02,804 INFO L280 TraceCheckUtils]: 7: Hoare triple {367#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646))} assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; {367#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646))} is VALID [2020-07-29 01:34:02,805 INFO L280 TraceCheckUtils]: 8: Hoare triple {367#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646))} test_fun_#t~short22 := test_fun_#t~short20; {367#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646))} is VALID [2020-07-29 01:34:02,807 INFO L280 TraceCheckUtils]: 9: Hoare triple {367#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646))} assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; {367#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646))} is VALID [2020-07-29 01:34:02,810 INFO L280 TraceCheckUtils]: 10: Hoare triple {367#(and (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 4294967293 (+ oldRank0 (* 2 (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 2147483646))} assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; {347#(or (and (> oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)) 4294967293)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:34:02,811 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:02,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:34:02,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:02,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 11 letters. [2020-07-29 01:34:02,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:02,857 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:34:02,859 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7 Second operand 6 states. [2020-07-29 01:34:03,447 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 73 states and 101 transitions. Complement of second has 12 states. [2020-07-29 01:34:03,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:03,448 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:03,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:03,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:03,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:03,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:34:03,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:34:03,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:03,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:03,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 101 transitions. [2020-07-29 01:34:03,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-07-29 01:34:03,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:03,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:03,478 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 23 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:03,489 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2020-07-29 01:34:03,491 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:34:03,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:34:03,495 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:03,495 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 73 states and 101 transitions. cyclomatic complexity: 30 [2020-07-29 01:34:03,501 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 27 examples of accepted words. [2020-07-29 01:34:03,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 11 letters. [2020-07-29 01:34:03,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 11 letters. [2020-07-29 01:34:03,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 2 letters. Loop has 11 letters. [2020-07-29 01:34:03,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:34:03,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:34:03,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:34:03,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 13 letters. [2020-07-29 01:34:03,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 13 letters. [2020-07-29 01:34:03,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 4 letters. Loop has 13 letters. [2020-07-29 01:34:03,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 73 letters. Loop has 73 letters. [2020-07-29 01:34:03,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 73 letters. Loop has 73 letters. [2020-07-29 01:34:03,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 73 letters. Loop has 73 letters. [2020-07-29 01:34:03,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:34:03,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:34:03,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:34:03,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:03,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:03,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:03,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:34:03,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:34:03,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:34:03,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:34:03,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:34:03,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:34:03,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 11 letters. [2020-07-29 01:34:03,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 11 letters. [2020-07-29 01:34:03,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 10 letters. Loop has 11 letters. [2020-07-29 01:34:03,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 11 letters. [2020-07-29 01:34:03,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 11 letters. [2020-07-29 01:34:03,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 5 letters. Loop has 11 letters. [2020-07-29 01:34:03,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 13 letters. [2020-07-29 01:34:03,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 13 letters. [2020-07-29 01:34:03,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 13 letters. [2020-07-29 01:34:03,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:03,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:03,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:03,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 11 letters. [2020-07-29 01:34:03,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 11 letters. [2020-07-29 01:34:03,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 12 letters. Loop has 11 letters. [2020-07-29 01:34:03,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 13 letters. [2020-07-29 01:34:03,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 13 letters. [2020-07-29 01:34:03,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 7 letters. Loop has 13 letters. [2020-07-29 01:34:03,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 13 letters. [2020-07-29 01:34:03,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 13 letters. [2020-07-29 01:34:03,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 13 letters. [2020-07-29 01:34:03,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 13 letters. [2020-07-29 01:34:03,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 13 letters. [2020-07-29 01:34:03,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 13 letters. [2020-07-29 01:34:03,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:34:03,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:34:03,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:34:03,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:34:03,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:34:03,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:34:03,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 11 letters. [2020-07-29 01:34:03,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 11 letters. [2020-07-29 01:34:03,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 2 letters. Loop has 11 letters. [2020-07-29 01:34:03,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 11 letters. [2020-07-29 01:34:03,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 11 letters. [2020-07-29 01:34:03,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 3 letters. Loop has 11 letters. [2020-07-29 01:34:03,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:34:03,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:34:03,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:34:03,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:34:03,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:34:03,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:34:03,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:34:03,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:34:03,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:34:03,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 13 letters. [2020-07-29 01:34:03,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 13 letters. [2020-07-29 01:34:03,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 13 letters. [2020-07-29 01:34:03,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 13 letters. [2020-07-29 01:34:03,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 13 letters. [2020-07-29 01:34:03,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 10 letters. Loop has 13 letters. [2020-07-29 01:34:03,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 11 letters. [2020-07-29 01:34:03,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 11 letters. [2020-07-29 01:34:03,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 10 letters. Loop has 11 letters. [2020-07-29 01:34:03,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 13 letters. [2020-07-29 01:34:03,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 13 letters. [2020-07-29 01:34:03,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 11 letters. Loop has 13 letters. [2020-07-29 01:34:03,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:03,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:03,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:03,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 13 letters. [2020-07-29 01:34:03,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 13 letters. [2020-07-29 01:34:03,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 12 letters. Loop has 13 letters. [2020-07-29 01:34:03,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 11 letters. [2020-07-29 01:34:03,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 11 letters. [2020-07-29 01:34:03,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 12 letters. Loop has 11 letters. [2020-07-29 01:34:03,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 13 letters. [2020-07-29 01:34:03,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 13 letters. [2020-07-29 01:34:03,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 4 letters. Loop has 13 letters. [2020-07-29 01:34:03,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:34:03,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:34:03,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:34:03,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:34:03,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:34:03,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:34:03,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:34:03,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:34:03,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:34:03,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 13 letters. [2020-07-29 01:34:03,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 13 letters. [2020-07-29 01:34:03,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 14 letters. Loop has 13 letters. [2020-07-29 01:34:03,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 13 letters. [2020-07-29 01:34:03,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 13 letters. [2020-07-29 01:34:03,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 5 letters. Loop has 13 letters. [2020-07-29 01:34:03,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 11 letters. [2020-07-29 01:34:03,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 11 letters. [2020-07-29 01:34:03,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 14 letters. Loop has 11 letters. [2020-07-29 01:34:03,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 11 letters. [2020-07-29 01:34:03,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 11 letters. [2020-07-29 01:34:03,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 5 letters. Loop has 11 letters. [2020-07-29 01:34:03,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 13 letters. [2020-07-29 01:34:03,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 13 letters. [2020-07-29 01:34:03,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 15 letters. Loop has 13 letters. [2020-07-29 01:34:03,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 13 letters. [2020-07-29 01:34:03,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 13 letters. [2020-07-29 01:34:03,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 13 letters. [2020-07-29 01:34:03,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:34:03,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:34:03,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:34:03,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 13 letters. [2020-07-29 01:34:03,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 13 letters. [2020-07-29 01:34:03,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 13 letters. [2020-07-29 01:34:03,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 13 letters. [2020-07-29 01:34:03,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 13 letters. [2020-07-29 01:34:03,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 7 letters. Loop has 13 letters. [2020-07-29 01:34:03,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:34:03,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:34:03,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:34:03,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 13 letters. [2020-07-29 01:34:03,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 13 letters. [2020-07-29 01:34:03,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 7 letters. Loop has 13 letters. [2020-07-29 01:34:03,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 13 letters. [2020-07-29 01:34:03,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 13 letters. [2020-07-29 01:34:03,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 13 letters. [2020-07-29 01:34:03,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:34:03,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:34:03,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:34:03,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 13 letters. [2020-07-29 01:34:03,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 13 letters. [2020-07-29 01:34:03,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 13 letters. [2020-07-29 01:34:03,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 13 letters. [2020-07-29 01:34:03,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 13 letters. [2020-07-29 01:34:03,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 13 letters. [2020-07-29 01:34:03,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,587 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:34:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2020-07-29 01:34:03,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 11 letters. [2020-07-29 01:34:03,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:34:03,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 22 letters. [2020-07-29 01:34:03,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:03,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 101 transitions. cyclomatic complexity: 30 [2020-07-29 01:34:03,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-07-29 01:34:03,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 66 states and 92 transitions. [2020-07-29 01:34:03,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-07-29 01:34:03,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-07-29 01:34:03,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 92 transitions. [2020-07-29 01:34:03,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:03,601 INFO L688 BuchiCegarLoop]: Abstraction has 66 states and 92 transitions. [2020-07-29 01:34:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 92 transitions. [2020-07-29 01:34:03,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2020-07-29 01:34:03,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:03,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states and 92 transitions. Second operand 45 states. [2020-07-29 01:34:03,606 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states and 92 transitions. Second operand 45 states. [2020-07-29 01:34:03,606 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand 45 states. [2020-07-29 01:34:03,607 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:03,612 INFO L93 Difference]: Finished difference Result 66 states and 92 transitions. [2020-07-29 01:34:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2020-07-29 01:34:03,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:03,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:03,613 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 66 states and 92 transitions. [2020-07-29 01:34:03,613 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 66 states and 92 transitions. [2020-07-29 01:34:03,614 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:03,619 INFO L93 Difference]: Finished difference Result 67 states and 94 transitions. [2020-07-29 01:34:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2020-07-29 01:34:03,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:03,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:03,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:03,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 01:34:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2020-07-29 01:34:03,622 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2020-07-29 01:34:03,622 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2020-07-29 01:34:03,622 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:34:03,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2020-07-29 01:34:03,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-07-29 01:34:03,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:03,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:03,624 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:03,624 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:03,624 INFO L794 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 502#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, 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); 503#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 486#L557-1 [2020-07-29 01:34:03,625 INFO L796 eck$LassoCheckResult]: Loop: 486#L557-1 assume !test_fun_#t~short9; 493#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 500#L557-4 assume test_fun_#t~short14; 516#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 489#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 490#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 496#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 498#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 508#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 511#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 485#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 486#L557-1 [2020-07-29 01:34:03,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-07-29 01:34:03,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:03,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228069322] [2020-07-29 01:34:03,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:03,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:03,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:03,669 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:03,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:03,670 INFO L82 PathProgramCache]: Analyzing trace with hash 962628681, now seen corresponding path program 1 times [2020-07-29 01:34:03,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:03,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531330790] [2020-07-29 01:34:03,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:03,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {741#true} assume !test_fun_#t~short9; {743#(not |ULTIMATE.start_test_fun_#t~short9|)} is VALID [2020-07-29 01:34:03,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {743#(not |ULTIMATE.start_test_fun_#t~short9|)} test_fun_#t~short14 := test_fun_#t~short9; {744#(not |ULTIMATE.start_test_fun_#t~short14|)} is VALID [2020-07-29 01:34:03,735 INFO L280 TraceCheckUtils]: 2: Hoare triple {744#(not |ULTIMATE.start_test_fun_#t~short14|)} assume test_fun_#t~short14; {742#false} is VALID [2020-07-29 01:34:03,735 INFO L280 TraceCheckUtils]: 3: Hoare triple {742#false} test_fun_#t~short18 := test_fun_#t~short14; {742#false} is VALID [2020-07-29 01:34:03,735 INFO L280 TraceCheckUtils]: 4: Hoare triple {742#false} assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; {742#false} is VALID [2020-07-29 01:34:03,735 INFO L280 TraceCheckUtils]: 5: Hoare triple {742#false} test_fun_#t~short20 := test_fun_#t~short18; {742#false} is VALID [2020-07-29 01:34:03,736 INFO L280 TraceCheckUtils]: 6: Hoare triple {742#false} assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; {742#false} is VALID [2020-07-29 01:34:03,736 INFO L280 TraceCheckUtils]: 7: Hoare triple {742#false} test_fun_#t~short22 := test_fun_#t~short20; {742#false} is VALID [2020-07-29 01:34:03,736 INFO L280 TraceCheckUtils]: 8: Hoare triple {742#false} assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; {742#false} is VALID [2020-07-29 01:34:03,736 INFO L280 TraceCheckUtils]: 9: Hoare triple {742#false} assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; {742#false} is VALID [2020-07-29 01:34:03,737 INFO L280 TraceCheckUtils]: 10: Hoare triple {742#false} call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; {742#false} is VALID [2020-07-29 01:34:03,737 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:03,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531330790] [2020-07-29 01:34:03,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:03,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:34:03,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624532819] [2020-07-29 01:34:03,738 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:03,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:03,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:34:03,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:34:03,739 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. cyclomatic complexity: 19 Second operand 4 states. [2020-07-29 01:34:03,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:03,908 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2020-07-29 01:34:03,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:34:03,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:34:03,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:03,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 82 transitions. [2020-07-29 01:34:03,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2020-07-29 01:34:03,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 82 transitions. [2020-07-29 01:34:03,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-07-29 01:34:03,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-07-29 01:34:03,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 82 transitions. [2020-07-29 01:34:03,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:03,937 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 82 transitions. [2020-07-29 01:34:03,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 82 transitions. [2020-07-29 01:34:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2020-07-29 01:34:03,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:03,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states and 82 transitions. Second operand 39 states. [2020-07-29 01:34:03,945 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states and 82 transitions. Second operand 39 states. [2020-07-29 01:34:03,945 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 39 states. [2020-07-29 01:34:03,946 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:03,953 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2020-07-29 01:34:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2020-07-29 01:34:03,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:03,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:03,954 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 59 states and 82 transitions. [2020-07-29 01:34:03,954 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 59 states and 82 transitions. [2020-07-29 01:34:03,955 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:03,960 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2020-07-29 01:34:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2020-07-29 01:34:03,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:03,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:03,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:03,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 01:34:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-07-29 01:34:03,968 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-07-29 01:34:03,968 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-07-29 01:34:03,968 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:34:03,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2020-07-29 01:34:03,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:03,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:03,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:03,969 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:03,969 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:03,970 INFO L794 eck$LassoCheckResult]: Stem: 831#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 825#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, 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); 826#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 811#L557-1 [2020-07-29 01:34:03,970 INFO L796 eck$LassoCheckResult]: Loop: 811#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 816#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 823#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 827#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 834#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 806#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 807#L557-10 assume !test_fun_#t~short18; 814#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 819#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 821#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 829#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 832#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 810#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 811#L557-1 [2020-07-29 01:34:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2020-07-29 01:34:03,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:03,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125304525] [2020-07-29 01:34:03,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:04,008 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:04,043 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:04,050 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:04,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:04,050 INFO L82 PathProgramCache]: Analyzing trace with hash 623036047, now seen corresponding path program 1 times [2020-07-29 01:34:04,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:04,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163581591] [2020-07-29 01:34:04,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:04,097 INFO L280 TraceCheckUtils]: 0: Hoare triple {1039#true} assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; {1039#true} is VALID [2020-07-29 01:34:04,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {1039#true} test_fun_#t~short14 := test_fun_#t~short9; {1039#true} is VALID [2020-07-29 01:34:04,097 INFO L280 TraceCheckUtils]: 2: Hoare triple {1039#true} assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; {1039#true} is VALID [2020-07-29 01:34:04,098 INFO L280 TraceCheckUtils]: 3: Hoare triple {1039#true} assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; {1039#true} is VALID [2020-07-29 01:34:04,098 INFO L280 TraceCheckUtils]: 4: Hoare triple {1039#true} test_fun_#t~short14 := test_fun_#t~short13; {1039#true} is VALID [2020-07-29 01:34:04,098 INFO L280 TraceCheckUtils]: 5: Hoare triple {1039#true} test_fun_#t~short18 := test_fun_#t~short14; {1039#true} is VALID [2020-07-29 01:34:04,099 INFO L280 TraceCheckUtils]: 6: Hoare triple {1039#true} assume !test_fun_#t~short18; {1041#(not |ULTIMATE.start_test_fun_#t~short18|)} is VALID [2020-07-29 01:34:04,100 INFO L280 TraceCheckUtils]: 7: Hoare triple {1041#(not |ULTIMATE.start_test_fun_#t~short18|)} test_fun_#t~short20 := test_fun_#t~short18; {1042#(not |ULTIMATE.start_test_fun_#t~short20|)} is VALID [2020-07-29 01:34:04,100 INFO L280 TraceCheckUtils]: 8: Hoare triple {1042#(not |ULTIMATE.start_test_fun_#t~short20|)} assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; {1040#false} is VALID [2020-07-29 01:34:04,100 INFO L280 TraceCheckUtils]: 9: Hoare triple {1040#false} test_fun_#t~short22 := test_fun_#t~short20; {1040#false} is VALID [2020-07-29 01:34:04,101 INFO L280 TraceCheckUtils]: 10: Hoare triple {1040#false} assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; {1040#false} is VALID [2020-07-29 01:34:04,101 INFO L280 TraceCheckUtils]: 11: Hoare triple {1040#false} assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; {1040#false} is VALID [2020-07-29 01:34:04,101 INFO L280 TraceCheckUtils]: 12: Hoare triple {1040#false} call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; {1040#false} is VALID [2020-07-29 01:34:04,102 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:04,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163581591] [2020-07-29 01:34:04,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:04,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:34:04,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528541940] [2020-07-29 01:34:04,103 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:04,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:04,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:34:04,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:34:04,104 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-07-29 01:34:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:04,230 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-29 01:34:04,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:34:04,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:34:04,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:04,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 78 transitions. [2020-07-29 01:34:04,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-07-29 01:34:04,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 78 transitions. [2020-07-29 01:34:04,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-29 01:34:04,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-29 01:34:04,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 78 transitions. [2020-07-29 01:34:04,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:04,256 INFO L688 BuchiCegarLoop]: Abstraction has 58 states and 78 transitions. [2020-07-29 01:34:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 78 transitions. [2020-07-29 01:34:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2020-07-29 01:34:04,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:04,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states and 78 transitions. Second operand 43 states. [2020-07-29 01:34:04,260 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states and 78 transitions. Second operand 43 states. [2020-07-29 01:34:04,260 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand 43 states. [2020-07-29 01:34:04,260 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:04,263 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2020-07-29 01:34:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2020-07-29 01:34:04,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:04,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:04,264 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 58 states and 78 transitions. [2020-07-29 01:34:04,264 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 58 states and 78 transitions. [2020-07-29 01:34:04,265 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:04,268 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2020-07-29 01:34:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2020-07-29 01:34:04,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:04,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:04,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:04,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 01:34:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-07-29 01:34:04,270 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-07-29 01:34:04,270 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-07-29 01:34:04,270 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:34:04,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2020-07-29 01:34:04,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-07-29 01:34:04,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:04,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:04,272 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:04,272 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:04,272 INFO L794 eck$LassoCheckResult]: Stem: 1134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1127#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, 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); 1128#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 1108#L557-1 [2020-07-29 01:34:04,272 INFO L796 eck$LassoCheckResult]: Loop: 1108#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 1116#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 1125#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 1129#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 1137#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 1103#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 1104#L557-10 assume !test_fun_#t~short18; 1111#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 1121#L557-13 assume !test_fun_#t~short20; 1122#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 1132#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 1135#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 1107#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 1108#L557-1 [2020-07-29 01:34:04,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:04,273 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2020-07-29 01:34:04,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:04,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825763965] [2020-07-29 01:34:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:04,286 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:04,309 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:04,316 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:04,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:04,317 INFO L82 PathProgramCache]: Analyzing trace with hash 624883089, now seen corresponding path program 1 times [2020-07-29 01:34:04,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:04,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241890473] [2020-07-29 01:34:04,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:04,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {1346#true} assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; {1346#true} is VALID [2020-07-29 01:34:04,363 INFO L280 TraceCheckUtils]: 1: Hoare triple {1346#true} test_fun_#t~short14 := test_fun_#t~short9; {1346#true} is VALID [2020-07-29 01:34:04,363 INFO L280 TraceCheckUtils]: 2: Hoare triple {1346#true} assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; {1346#true} is VALID [2020-07-29 01:34:04,364 INFO L280 TraceCheckUtils]: 3: Hoare triple {1346#true} assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; {1346#true} is VALID [2020-07-29 01:34:04,364 INFO L280 TraceCheckUtils]: 4: Hoare triple {1346#true} test_fun_#t~short14 := test_fun_#t~short13; {1346#true} is VALID [2020-07-29 01:34:04,364 INFO L280 TraceCheckUtils]: 5: Hoare triple {1346#true} test_fun_#t~short18 := test_fun_#t~short14; {1346#true} is VALID [2020-07-29 01:34:04,364 INFO L280 TraceCheckUtils]: 6: Hoare triple {1346#true} assume !test_fun_#t~short18; {1346#true} is VALID [2020-07-29 01:34:04,365 INFO L280 TraceCheckUtils]: 7: Hoare triple {1346#true} test_fun_#t~short20 := test_fun_#t~short18; {1346#true} is VALID [2020-07-29 01:34:04,369 INFO L280 TraceCheckUtils]: 8: Hoare triple {1346#true} assume !test_fun_#t~short20; {1348#(not |ULTIMATE.start_test_fun_#t~short20|)} is VALID [2020-07-29 01:34:04,370 INFO L280 TraceCheckUtils]: 9: Hoare triple {1348#(not |ULTIMATE.start_test_fun_#t~short20|)} test_fun_#t~short22 := test_fun_#t~short20; {1349#(not |ULTIMATE.start_test_fun_#t~short22|)} is VALID [2020-07-29 01:34:04,371 INFO L280 TraceCheckUtils]: 10: Hoare triple {1349#(not |ULTIMATE.start_test_fun_#t~short22|)} assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; {1347#false} is VALID [2020-07-29 01:34:04,371 INFO L280 TraceCheckUtils]: 11: Hoare triple {1347#false} assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; {1347#false} is VALID [2020-07-29 01:34:04,371 INFO L280 TraceCheckUtils]: 12: Hoare triple {1347#false} call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; {1347#false} is VALID [2020-07-29 01:34:04,372 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:04,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241890473] [2020-07-29 01:34:04,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:04,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:34:04,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245424696] [2020-07-29 01:34:04,375 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:04,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:04,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:34:04,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:34:04,376 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-07-29 01:34:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:04,482 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2020-07-29 01:34:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:34:04,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:34:04,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:04,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 64 transitions. [2020-07-29 01:34:04,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:04,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 39 states and 46 transitions. [2020-07-29 01:34:04,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:34:04,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:34:04,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2020-07-29 01:34:04,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:04,509 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-07-29 01:34:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2020-07-29 01:34:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-29 01:34:04,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:04,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states and 46 transitions. Second operand 39 states. [2020-07-29 01:34:04,512 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states and 46 transitions. Second operand 39 states. [2020-07-29 01:34:04,513 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 39 states. [2020-07-29 01:34:04,513 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:04,515 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-29 01:34:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-29 01:34:04,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:04,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:04,516 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states and 46 transitions. [2020-07-29 01:34:04,517 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states and 46 transitions. [2020-07-29 01:34:04,517 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:04,519 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-29 01:34:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-29 01:34:04,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:04,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:04,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:04,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 01:34:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2020-07-29 01:34:04,523 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-07-29 01:34:04,523 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-07-29 01:34:04,523 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:34:04,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2020-07-29 01:34:04,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:04,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:04,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:04,525 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:04,525 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:04,525 INFO L794 eck$LassoCheckResult]: Stem: 1433#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1427#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, 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); 1428#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 1412#L557-1 [2020-07-29 01:34:04,526 INFO L796 eck$LassoCheckResult]: Loop: 1412#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 1417#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 1425#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 1429#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 1436#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 1407#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 1408#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 1415#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 1420#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 1422#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 1431#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 1434#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 1411#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 1412#L557-1 [2020-07-29 01:34:04,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:04,526 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 4 times [2020-07-29 01:34:04,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:04,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724700887] [2020-07-29 01:34:04,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:04,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:04,554 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:04,558 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:04,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:04,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1151971315, now seen corresponding path program 1 times [2020-07-29 01:34:04,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:04,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230518884] [2020-07-29 01:34:04,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:04,660 INFO L280 TraceCheckUtils]: 0: Hoare triple {1595#true} assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; {1597#(or |ULTIMATE.start_test_fun_#t~short9| (<= 2147483647 (+ (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))))} is VALID [2020-07-29 01:34:04,662 INFO L280 TraceCheckUtils]: 1: Hoare triple {1597#(or |ULTIMATE.start_test_fun_#t~short9| (<= 2147483647 (+ (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))))} test_fun_#t~short14 := test_fun_#t~short9; {1598#(or |ULTIMATE.start_test_fun_#t~short14| (<= 2147483647 (+ (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))))} is VALID [2020-07-29 01:34:04,663 INFO L280 TraceCheckUtils]: 2: Hoare triple {1598#(or |ULTIMATE.start_test_fun_#t~short14| (<= 2147483647 (+ (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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))))} assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; {1599#(or (<= 2147483648 (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_#t~short13|))} is VALID [2020-07-29 01:34:04,665 INFO L280 TraceCheckUtils]: 3: Hoare triple {1599#(or (<= 2147483648 (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_#t~short13|))} assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; {1600#(<= 2147483648 (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:04,666 INFO L280 TraceCheckUtils]: 4: Hoare triple {1600#(<= 2147483648 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))} test_fun_#t~short14 := test_fun_#t~short13; {1600#(<= 2147483648 (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:04,666 INFO L280 TraceCheckUtils]: 5: Hoare triple {1600#(<= 2147483648 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))} test_fun_#t~short18 := test_fun_#t~short14; {1600#(<= 2147483648 (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:04,667 INFO L280 TraceCheckUtils]: 6: Hoare triple {1600#(<= 2147483648 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))} assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; {1600#(<= 2147483648 (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:04,668 INFO L280 TraceCheckUtils]: 7: Hoare triple {1600#(<= 2147483648 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))} test_fun_#t~short20 := test_fun_#t~short18; {1600#(<= 2147483648 (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:04,668 INFO L280 TraceCheckUtils]: 8: Hoare triple {1600#(<= 2147483648 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))} assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; {1600#(<= 2147483648 (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:04,669 INFO L280 TraceCheckUtils]: 9: Hoare triple {1600#(<= 2147483648 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))} test_fun_#t~short22 := test_fun_#t~short20; {1600#(<= 2147483648 (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:04,671 INFO L280 TraceCheckUtils]: 10: Hoare triple {1600#(<= 2147483648 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))} assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; {1601#(not |ULTIMATE.start_test_fun_#t~short22|)} is VALID [2020-07-29 01:34:04,671 INFO L280 TraceCheckUtils]: 11: Hoare triple {1601#(not |ULTIMATE.start_test_fun_#t~short22|)} assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; {1596#false} is VALID [2020-07-29 01:34:04,672 INFO L280 TraceCheckUtils]: 12: Hoare triple {1596#false} call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; {1596#false} is VALID [2020-07-29 01:34:04,672 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:04,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230518884] [2020-07-29 01:34:04,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:04,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:34:04,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115764757] [2020-07-29 01:34:04,674 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:04,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:04,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:34:04,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:34:04,674 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-07-29 01:34:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:05,248 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2020-07-29 01:34:05,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:34:05,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:34:05,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:05,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 98 transitions. [2020-07-29 01:34:05,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2020-07-29 01:34:05,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 75 states and 82 transitions. [2020-07-29 01:34:05,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-07-29 01:34:05,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2020-07-29 01:34:05,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 82 transitions. [2020-07-29 01:34:05,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:05,278 INFO L688 BuchiCegarLoop]: Abstraction has 75 states and 82 transitions. [2020-07-29 01:34:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 82 transitions. [2020-07-29 01:34:05,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2020-07-29 01:34:05,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:05,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states and 82 transitions. Second operand 43 states. [2020-07-29 01:34:05,281 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states and 82 transitions. Second operand 43 states. [2020-07-29 01:34:05,281 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 43 states. [2020-07-29 01:34:05,282 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:05,285 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2020-07-29 01:34:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2020-07-29 01:34:05,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:05,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:05,286 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 75 states and 82 transitions. [2020-07-29 01:34:05,286 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 75 states and 82 transitions. [2020-07-29 01:34:05,286 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:05,289 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2020-07-29 01:34:05,289 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2020-07-29 01:34:05,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:05,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:05,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:05,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 01:34:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2020-07-29 01:34:05,292 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-07-29 01:34:05,292 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-07-29 01:34:05,292 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:34:05,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2020-07-29 01:34:05,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-07-29 01:34:05,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:05,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:05,293 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:05,293 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:05,293 INFO L794 eck$LassoCheckResult]: Stem: 1733#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1725#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, 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); 1726#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 1710#L557-1 [2020-07-29 01:34:05,293 INFO L796 eck$LassoCheckResult]: Loop: 1710#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 1715#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 1723#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 1736#L557-6 assume !test_fun_#t~short13; 1737#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 1705#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 1706#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 1713#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 1719#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 1721#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 1731#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 1734#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 1709#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 1710#L557-1 [2020-07-29 01:34:05,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:05,294 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 5 times [2020-07-29 01:34:05,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:05,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531079114] [2020-07-29 01:34:05,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:05,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:05,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:05,322 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:05,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:05,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1544998325, now seen corresponding path program 1 times [2020-07-29 01:34:05,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:05,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103569373] [2020-07-29 01:34:05,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:05,356 INFO L280 TraceCheckUtils]: 0: Hoare triple {1983#true} assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; {1983#true} is VALID [2020-07-29 01:34:05,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {1983#true} test_fun_#t~short14 := test_fun_#t~short9; {1983#true} is VALID [2020-07-29 01:34:05,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {1983#true} assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; {1983#true} is VALID [2020-07-29 01:34:05,357 INFO L280 TraceCheckUtils]: 3: Hoare triple {1983#true} assume !test_fun_#t~short13; {1985#(not |ULTIMATE.start_test_fun_#t~short13|)} is VALID [2020-07-29 01:34:05,357 INFO L280 TraceCheckUtils]: 4: Hoare triple {1985#(not |ULTIMATE.start_test_fun_#t~short13|)} test_fun_#t~short14 := test_fun_#t~short13; {1986#(not |ULTIMATE.start_test_fun_#t~short14|)} is VALID [2020-07-29 01:34:05,358 INFO L280 TraceCheckUtils]: 5: Hoare triple {1986#(not |ULTIMATE.start_test_fun_#t~short14|)} test_fun_#t~short18 := test_fun_#t~short14; {1987#(not |ULTIMATE.start_test_fun_#t~short18|)} is VALID [2020-07-29 01:34:05,359 INFO L280 TraceCheckUtils]: 6: Hoare triple {1987#(not |ULTIMATE.start_test_fun_#t~short18|)} assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; {1984#false} is VALID [2020-07-29 01:34:05,359 INFO L280 TraceCheckUtils]: 7: Hoare triple {1984#false} test_fun_#t~short20 := test_fun_#t~short18; {1984#false} is VALID [2020-07-29 01:34:05,359 INFO L280 TraceCheckUtils]: 8: Hoare triple {1984#false} assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; {1984#false} is VALID [2020-07-29 01:34:05,360 INFO L280 TraceCheckUtils]: 9: Hoare triple {1984#false} test_fun_#t~short22 := test_fun_#t~short20; {1984#false} is VALID [2020-07-29 01:34:05,360 INFO L280 TraceCheckUtils]: 10: Hoare triple {1984#false} assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; {1984#false} is VALID [2020-07-29 01:34:05,360 INFO L280 TraceCheckUtils]: 11: Hoare triple {1984#false} assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; {1984#false} is VALID [2020-07-29 01:34:05,360 INFO L280 TraceCheckUtils]: 12: Hoare triple {1984#false} call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; {1984#false} is VALID [2020-07-29 01:34:05,361 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:05,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103569373] [2020-07-29 01:34:05,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:05,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:34:05,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810975756] [2020-07-29 01:34:05,362 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:05,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:05,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:34:05,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:34:05,362 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-07-29 01:34:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:05,492 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-29 01:34:05,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:34:05,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:34:05,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:05,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 54 transitions. [2020-07-29 01:34:05,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:05,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 39 states and 42 transitions. [2020-07-29 01:34:05,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:34:05,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:34:05,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 42 transitions. [2020-07-29 01:34:05,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:05,517 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-29 01:34:05,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 42 transitions. [2020-07-29 01:34:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-29 01:34:05,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:05,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states and 42 transitions. Second operand 39 states. [2020-07-29 01:34:05,521 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states and 42 transitions. Second operand 39 states. [2020-07-29 01:34:05,522 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 39 states. [2020-07-29 01:34:05,523 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:05,524 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-29 01:34:05,524 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-29 01:34:05,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:05,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:05,525 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states and 42 transitions. [2020-07-29 01:34:05,525 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states and 42 transitions. [2020-07-29 01:34:05,525 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:05,534 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-29 01:34:05,535 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-29 01:34:05,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:05,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:05,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:05,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 01:34:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-29 01:34:05,537 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-29 01:34:05,537 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-29 01:34:05,537 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:34:05,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2020-07-29 01:34:05,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:05,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:05,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:05,538 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:05,538 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:05,538 INFO L794 eck$LassoCheckResult]: Stem: 2066#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2061#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, 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); 2062#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 2046#L557-1 [2020-07-29 01:34:05,539 INFO L796 eck$LassoCheckResult]: Loop: 2046#L557-1 assume !test_fun_#t~short9; 2051#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 2059#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 2063#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 2069#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 2041#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 2042#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 2049#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 2054#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 2056#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 2064#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 2067#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 2045#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 2046#L557-1 [2020-07-29 01:34:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 6 times [2020-07-29 01:34:05,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:05,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690703741] [2020-07-29 01:34:05,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:05,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:05,569 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:05,574 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:05,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:05,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1738777329, now seen corresponding path program 1 times [2020-07-29 01:34:05,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:05,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010110890] [2020-07-29 01:34:05,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:05,598 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:05,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:05,616 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:05,617 INFO L82 PathProgramCache]: Analyzing trace with hash -403715764, now seen corresponding path program 1 times [2020-07-29 01:34:05,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:05,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555528470] [2020-07-29 01:34:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:05,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:05,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:05,666 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:06,090 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 95 [2020-07-29 01:34:06,736 WARN L193 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 114 [2020-07-29 01:34:07,036 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-07-29 01:34:07,041 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:07,041 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:07,041 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:07,041 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:07,041 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:07,041 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:07,041 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:07,042 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:07,042 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration8_Lasso [2020-07-29 01:34:07,042 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:07,042 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:07,114 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:07,123 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:07,126 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:07,129 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:07,133 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:07,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:07,140 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:07,144 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:07,148 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:07,152 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:07,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:07,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:07,163 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:07,168 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:07,172 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:07,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:07,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:07,185 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:07,189 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:07,194 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:08,662 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2020-07-29 01:34:09,343 WARN L193 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2020-07-29 01:34:09,357 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:09,360 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:09,365 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:09,371 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:09,376 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:09,381 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:09,385 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:09,966 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2020-07-29 01:34:10,354 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2020-07-29 01:34:10,909 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-07-29 01:34:11,116 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-07-29 01:34:11,497 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:11,497 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:34:11,507 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:11,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,537 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:11,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,540 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:11,564 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:11,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,569 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:11,592 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,619 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:11,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:11,646 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:11,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,653 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) [2020-07-29 01:34:11,677 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:11,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,681 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:11,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:11,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,716 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:11,758 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:11,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:11,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,768 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,794 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:11,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,822 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:11,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,825 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:11,849 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:11,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:11,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:11,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,879 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:11,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:11,905 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,934 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:11,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,961 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:11,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:11,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:11,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:11,993 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:11,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:11,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:11,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:11,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:11,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:11,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:11,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:11,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:12,022 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:12,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:12,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:12,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:12,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:12,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:12,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:12,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:12,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:12,052 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:12,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:12,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:12,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:12,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:12,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:12,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:12,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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:12,091 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:12,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:12,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:12,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:12,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:12,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:12,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:12,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:12,121 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:12,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:12,124 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:34:12,124 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:34:12,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:12,158 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-07-29 01:34:12,158 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:34:12,256 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:12,360 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2020-07-29 01:34:12,360 INFO L444 ModelExtractionUtils]: 47 out of 76 variables were initially zero. Simplification set additionally 26 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:12,363 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:34:12,366 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-07-29 01:34:12,367 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:12,367 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 4294967293 Supporting invariants [] [2020-07-29 01:34:12,608 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2020-07-29 01:34:12,614 INFO L393 LassoCheck]: Loop: "assume !test_fun_#t~short9;" "test_fun_#t~short14 := test_fun_#t~short9;" "assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0;" "assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11;" "test_fun_#t~short14 := test_fun_#t~short13;" "test_fun_#t~short18 := test_fun_#t~short14;" "assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16;" "test_fun_#t~short20 := test_fun_#t~short18;" "assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647;" "test_fun_#t~short22 := test_fun_#t~short20;" "assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647;" "assume !!test_fun_#t~short22;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short13;havoc test_fun_#t~mem21;havoc test_fun_#t~mem12;havoc test_fun_#t~short18;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~short22;havoc test_fun_#t~mem17;havoc test_fun_#t~mem15;havoc test_fun_#t~mem16;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24;" "call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0;" [2020-07-29 01:34:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:12,625 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:12,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:12,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:12,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:12,672 INFO L280 TraceCheckUtils]: 0: Hoare triple {2229#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2229#unseeded} is VALID [2020-07-29 01:34:12,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {2229#unseeded} havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, 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); {2229#unseeded} is VALID [2020-07-29 01:34:12,673 INFO L280 TraceCheckUtils]: 2: Hoare triple {2229#unseeded} call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; {2229#unseeded} is VALID [2020-07-29 01:34:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:12,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:34:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:12,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:12,732 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:12,914 INFO L350 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2020-07-29 01:34:12,915 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 109 [2020-07-29 01:34:12,931 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:12,932 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:12,933 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:12,935 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:12,936 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:12,937 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:12,939 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:12,940 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:12,941 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:12,942 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:12,943 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:12,944 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:12,946 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:12,947 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:12,948 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:12,950 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:12,951 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:12,952 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:12,953 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:12,955 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:12,956 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:12,957 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:12,958 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:12,959 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:12,960 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:12,962 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:12,963 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:12,964 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:12,965 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:12,968 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:12,968 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:12,969 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:12,970 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:12,972 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:12,973 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:12,974 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:18,244 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2020-07-29 01:34:18,245 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: No Interpolants at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.getInterpolants(InterpolatingTraceCheck.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:738) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:551) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 01:34:18,249 INFO L168 Benchmark]: Toolchain (without parser) took 24270.01 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 476.6 MB). Free memory was 961.6 MB in the beginning and 1.3 GB in the end (delta: -385.6 MB). Peak memory consumption was 91.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:18,250 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:18,250 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:18,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:18,251 INFO L168 Benchmark]: Boogie Preprocessor took 33.70 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:34:18,252 INFO L168 Benchmark]: RCFGBuilder took 604.23 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: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:18,252 INFO L168 Benchmark]: BuchiAutomizer took 22891.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 332.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -271.6 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:18,255 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 675.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.70 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 604.23 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: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22891.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 332.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -271.6 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: No Interpolants de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: No Interpolants: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.getInterpolants(InterpolatingTraceCheck.java:149) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...