./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max.i --full-output -ea --architecture 32bit


--------------------------------------------------------------------------------


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/reducercommutativity/max.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash c721a987debd4748cfed075333b7fa46c2d0f9ef
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
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*32bit*_Bitvector*.epf
No suitable settings file found using Termination*32bit*_Bitvector
ERROR: UNSUPPORTED PROPERTY
Writing output log to file Ultimate.log
Result:
ERROR: ExceptionOrErrorResult: AssertionError: null

--- Real Ultimate output ---
This is Ultimate 0.1.25-8bd4bc6
[2020-07-29 03:24:35,531 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-07-29 03:24:35,534 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-29 03:24:35,546 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-29 03:24:35,547 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-29 03:24:35,548 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-29 03:24:35,549 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-29 03:24:35,551 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-29 03:24:35,553 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-29 03:24:35,555 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-29 03:24:35,556 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-07-29 03:24:35,557 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-29 03:24:35,558 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-29 03:24:35,559 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-29 03:24:35,560 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-29 03:24:35,562 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-29 03:24:35,563 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-29 03:24:35,564 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-29 03:24:35,566 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-29 03:24:35,568 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-29 03:24:35,570 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-29 03:24:35,571 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-29 03:24:35,573 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-07-29 03:24:35,574 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-29 03:24:35,577 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-29 03:24:35,577 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-29 03:24:35,578 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-29 03:24:35,579 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-29 03:24:35,579 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-29 03:24:35,581 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-29 03:24:35,581 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-29 03:24:35,582 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-29 03:24:35,583 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-29 03:24:35,584 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-29 03:24:35,585 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-29 03:24:35,585 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-29 03:24:35,586 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-29 03:24:35,586 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-29 03:24:35,587 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-29 03:24:35,588 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-29 03:24:35,589 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-07-29 03:24:35,590 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf
[2020-07-29 03:24:35,615 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-07-29 03:24:35,616 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-29 03:24:35,617 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-07-29 03:24:35,618 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-07-29 03:24:35,619 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-07-29 03:24:35,619 INFO  L136        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2020-07-29 03:24:35,620 INFO  L138        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2020-07-29 03:24:35,620 INFO  L138        SettingsManager]:  * Use old map elimination=false
[2020-07-29 03:24:35,620 INFO  L138        SettingsManager]:  * Use external solver (rank synthesis)=false
[2020-07-29 03:24:35,621 INFO  L138        SettingsManager]:  * Use only trivial implications for array writes=true
[2020-07-29 03:24:35,622 INFO  L138        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2020-07-29 03:24:35,622 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-29 03:24:35,623 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-07-29 03:24:35,623 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2020-07-29 03:24:35,624 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-07-29 03:24:35,624 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-07-29 03:24:35,624 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-07-29 03:24:35,625 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2020-07-29 03:24:35,625 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2020-07-29 03:24:35,625 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2020-07-29 03:24:35,626 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-07-29 03:24:35,626 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-07-29 03:24:35,626 INFO  L138        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2020-07-29 03:24:35,627 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-07-29 03:24:35,627 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2020-07-29 03:24:35,627 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-29 03:24:35,627 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-07-29 03:24:35,628 INFO  L138        SettingsManager]:  * To the following directory=/home/matthias/ultimate/dump
[2020-07-29 03:24:35,628 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-29 03:24:35,628 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-07-29 03:24:35,629 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-07-29 03:24:35,630 INFO  L138        SettingsManager]:  * Dump automata to the following directory=/home/matthias/ultimate/dump/auto
[2020-07-29 03:24:35,631 INFO  L136        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2020-07-29 03:24:35,632 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 -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c721a987debd4748cfed075333b7fa46c2d0f9ef
[2020-07-29 03:24:35,988 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-29 03:24:36,002 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-29 03:24:36,006 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-29 03:24:36,008 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-07-29 03:24:36,008 INFO  L275        PluginConnector]: CDTParser initialized
[2020-07-29 03:24:36,009 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max.i
[2020-07-29 03:24:36,089 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7b4b034/666b98b7cee64f72bc508ae90ef1fbca/FLAG75529f1b3
[2020-07-29 03:24:36,538 INFO  L306              CDTParser]: Found 1 translation units.
[2020-07-29 03:24:36,539 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i
[2020-07-29 03:24:36,548 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7b4b034/666b98b7cee64f72bc508ae90ef1fbca/FLAG75529f1b3
[2020-07-29 03:24:36,915 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7b4b034/666b98b7cee64f72bc508ae90ef1fbca
[2020-07-29 03:24:36,919 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-29 03:24:36,923 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2020-07-29 03:24:36,924 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-29 03:24:36,925 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-29 03:24:36,928 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-29 03:24:36,930 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:24:36" (1/1) ...
[2020-07-29 03:24:36,933 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f0f731d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:36, skipping insertion in model container
[2020-07-29 03:24:36,934 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:24:36" (1/1) ...
[2020-07-29 03:24:36,942 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-07-29 03:24:36,961 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-07-29 03:24:37,145 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-29 03:24:37,157 INFO  L203         MainTranslator]: Completed pre-run
[2020-07-29 03:24:37,198 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-29 03:24:37,213 INFO  L208         MainTranslator]: Completed translation
[2020-07-29 03:24:37,213 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:37 WrapperNode
[2020-07-29 03:24:37,213 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-29 03:24:37,214 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-07-29 03:24:37,214 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-07-29 03:24:37,215 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-07-29 03:24:37,222 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:37" (1/1) ...
[2020-07-29 03:24:37,294 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:37" (1/1) ...
[2020-07-29 03:24:37,332 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-07-29 03:24:37,333 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-29 03:24:37,333 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-29 03:24:37,333 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-07-29 03:24:37,343 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:37" (1/1) ...
[2020-07-29 03:24:37,344 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:37" (1/1) ...
[2020-07-29 03:24:37,347 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:37" (1/1) ...
[2020-07-29 03:24:37,347 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:37" (1/1) ...
[2020-07-29 03:24:37,359 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:37" (1/1) ...
[2020-07-29 03:24:37,366 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:37" (1/1) ...
[2020-07-29 03:24:37,368 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:37" (1/1) ...
[2020-07-29 03:24:37,371 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-29 03:24:37,372 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-29 03:24:37,372 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-07-29 03:24:37,372 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-07-29 03:24:37,373 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:37" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2020-07-29 03:24:37,451 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-07-29 03:24:37,451 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-29 03:24:37,451 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-29 03:24:37,451 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2020-07-29 03:24:37,452 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-07-29 03:24:37,452 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-07-29 03:24:37,997 INFO  L290             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-29 03:24:37,997 INFO  L295             CfgBuilder]: Removed 14 assume(true) statements.
[2020-07-29 03:24:38,001 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:24:38 BoogieIcfgContainer
[2020-07-29 03:24:38,002 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-29 03:24:38,003 INFO  L113        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2020-07-29 03:24:38,003 INFO  L271        PluginConnector]: Initializing BuchiAutomizer...
[2020-07-29 03:24:38,007 INFO  L275        PluginConnector]: BuchiAutomizer initialized
[2020-07-29 03:24:38,008 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2020-07-29 03:24:38,009 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:24:36" (1/3) ...
[2020-07-29 03:24:38,010 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38450709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:24:38, skipping insertion in model container
[2020-07-29 03:24:38,011 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2020-07-29 03:24:38,011 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:37" (2/3) ...
[2020-07-29 03:24:38,012 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38450709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:24:38, skipping insertion in model container
[2020-07-29 03:24:38,013 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2020-07-29 03:24:38,014 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:24:38" (3/3) ...
[2020-07-29 03:24:38,018 INFO  L371   chiAutomizerObserver]: Analyzing ICFG max.i
[2020-07-29 03:24:38,079 INFO  L356         BuchiCegarLoop]: Interprodecural is true
[2020-07-29 03:24:38,079 INFO  L357         BuchiCegarLoop]: Hoare is false
[2020-07-29 03:24:38,079 INFO  L358         BuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2020-07-29 03:24:38,080 INFO  L359         BuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-29 03:24:38,080 INFO  L360         BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-29 03:24:38,081 INFO  L361         BuchiCegarLoop]: Difference is false
[2020-07-29 03:24:38,081 INFO  L362         BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-29 03:24:38,081 INFO  L365         BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop========
[2020-07-29 03:24:38,101 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states.
[2020-07-29 03:24:38,154 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 14
[2020-07-29 03:24:38,154 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2020-07-29 03:24:38,154 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2020-07-29 03:24:38,163 INFO  L849         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2020-07-29 03:24:38,163 INFO  L850         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2020-07-29 03:24:38,163 INFO  L424         BuchiCegarLoop]: ======== Iteration 1============
[2020-07-29 03:24:38,164 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states.
[2020-07-29 03:24:38,175 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 14
[2020-07-29 03:24:38,176 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2020-07-29 03:24:38,176 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2020-07-29 03:24:38,177 INFO  L849         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2020-07-29 03:24:38,178 INFO  L850         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2020-07-29 03:24:38,184 INFO  L794   eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 9#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 8#L20true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 6#L11-3true 
[2020-07-29 03:24:38,184 INFO  L796   eck$LassoCheckResult]: Loop: 6#L11-3true assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 12#L12true assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 11#L12-2true max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 7#L11-2true max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6#L11-3true 
[2020-07-29 03:24:38,189 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-29 03:24:38,190 INFO  L82        PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times
[2020-07-29 03:24:38,198 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-29 03:24:38,199 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243145027]
[2020-07-29 03:24:38,199 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-29 03:24:38,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-29 03:24:38,298 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-07-29 03:24:38,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-29 03:24:38,310 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-07-29 03:24:38,333 INFO  L174   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-07-29 03:24:38,335 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-29 03:24:38,335 INFO  L82        PathProgramCache]: Analyzing trace with hash 1326822, now seen corresponding path program 1 times
[2020-07-29 03:24:38,335 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-29 03:24:38,336 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728743151]
[2020-07-29 03:24:38,336 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-29 03:24:38,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-29 03:24:38,347 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-07-29 03:24:38,355 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-29 03:24:38,356 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-07-29 03:24:38,360 INFO  L174   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-07-29 03:24:38,362 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-29 03:24:38,362 INFO  L82        PathProgramCache]: Analyzing trace with hash 1805089543, now seen corresponding path program 1 times
[2020-07-29 03:24:38,362 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-29 03:24:38,362 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65597355]
[2020-07-29 03:24:38,363 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-29 03:24:38,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-29 03:24:38,387 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-07-29 03:24:38,407 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-29 03:24:38,407 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-07-29 03:24:38,414 INFO  L174   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-07-29 03:24:38,676 WARN  L193               SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46
[2020-07-29 03:24:38,769 INFO  L210          LassoAnalysis]: Preferences:
[2020-07-29 03:24:38,770 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2020-07-29 03:24:38,770 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2020-07-29 03:24:38,770 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2020-07-29 03:24:38,771 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2020-07-29 03:24:38,771 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2020-07-29 03:24:38,771 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2020-07-29 03:24:38,772 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2020-07-29 03:24:38,772 INFO  L133   ssoRankerPreferences]: Filename of dumped script: max.i_Iteration1_Lasso
[2020-07-29 03:24:38,772 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2020-07-29 03:24:38,773 INFO  L274          LassoAnalysis]: Starting lasso preprocessing...
[2020-07-29 03:24:38,823 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 03:24:38,835 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 03:24:38,841 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2020-07-29 03:24:38,847 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2020-07-29 03:24:38,853 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 03:24:38,859 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 03:24:38,865 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 03:24:38,872 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 03:24:38,881 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 03:24:38,887 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 03:24:38,893 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 03:24:38,899 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 03:24:38,908 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 03:24:38,913 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2020-07-29 03:24:38,918 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 03:24:38,924 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 03:24:38,929 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2020-07-29 03:24:39,117 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 03:24:39,122 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2020-07-29 03:24:39,128 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 03:24:39,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 03:24:39,138 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 03:24:39,145 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 03:24:39,890 INFO  L292          LassoAnalysis]: Preprocessing complete.
[2020-07-29 03:24:39,896 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 03:24:39,901 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 03:24:39,906 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:39,906 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2020-07-29 03:24:39,907 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:39,907 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:39,907 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:39,910 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2020-07-29 03:24:39,910 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2020-07-29 03:24:39,913 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 03:24:39,947 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 03:24:39,949 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:39,949 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2020-07-29 03:24:39,950 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:39,950 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:39,950 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:39,952 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2020-07-29 03:24:39,952 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2020-07-29 03:24:39,954 INFO  L522          LassoAnalysis]: Proving termination failed for this template and these settings.
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2020-07-29 03:24:39,977 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 03:24:39,978 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:39,978 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2020-07-29 03:24:39,978 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:39,979 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:39,979 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:39,982 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2020-07-29 03:24:39,982 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2020-07-29 03:24:39,984 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 03:24:40,011 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 03:24:40,012 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,012 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2020-07-29 03:24:40,013 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,013 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,013 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,014 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2020-07-29 03:24:40,014 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2020-07-29 03:24:40,017 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 03:24:40,044 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 03:24:40,045 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,045 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2020-07-29 03:24:40,046 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,046 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,046 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,048 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2020-07-29 03:24:40,048 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2020-07-29 03:24:40,050 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 03:24:40,077 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 03:24:40,079 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,079 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2020-07-29 03:24:40,079 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,079 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,080 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,080 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2020-07-29 03:24:40,080 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2020-07-29 03:24:40,082 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 03:24:40,106 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 03:24:40,107 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,107 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2020-07-29 03:24:40,108 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,108 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,108 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,109 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2020-07-29 03:24:40,109 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2020-07-29 03:24:40,113 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 03:24:40,137 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 03:24:40,139 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,139 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,140 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,140 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,144 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2020-07-29 03:24:40,145 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2020-07-29 03:24:40,149 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 03:24:40,191 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 03:24:40,199 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,199 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2020-07-29 03:24:40,199 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,199 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,200 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,201 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2020-07-29 03:24:40,202 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2020-07-29 03:24:40,204 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 03:24:40,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 03:24:40,234 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,234 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2020-07-29 03:24:40,234 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,234 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,234 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,235 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2020-07-29 03:24:40,235 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2020-07-29 03:24:40,237 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 03:24:40,260 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 03:24:40,262 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,262 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2020-07-29 03:24:40,262 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,262 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,262 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,265 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2020-07-29 03:24:40,265 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2020-07-29 03:24:40,267 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 03:24:40,291 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 03:24:40,292 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,293 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,293 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,293 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,296 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2020-07-29 03:24:40,297 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2020-07-29 03:24:40,306 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 03:24:40,329 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 03:24:40,331 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,331 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2020-07-29 03:24:40,331 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,331 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,331 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,332 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2020-07-29 03:24:40,332 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2020-07-29 03:24:40,334 INFO  L522          LassoAnalysis]: Proving termination failed for this template and these settings.
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2020-07-29 03:24:40,361 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings:
Termination analysis: LINEAR_WITH_GUESSES
Number of strict supporting invariants: 0
Number of non-strict supporting invariants: 1
Consider only non-deceasing supporting invariants: true
Simplify termination arguments: true
Simplify supporting invariants: trueOverapproximate stem: false
[2020-07-29 03:24:40,362 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,363 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2020-07-29 03:24:40,363 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,363 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,363 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,364 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2020-07-29 03:24:40,364 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2020-07-29 03:24:40,369 INFO  L522          LassoAnalysis]: Proving termination failed for this template and these settings.
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2020-07-29 03:24:40,392 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings:
Termination analysis: LINEAR_WITH_GUESSES
Number of strict supporting invariants: 0
Number of non-strict supporting invariants: 1
Consider only non-deceasing supporting invariants: true
Simplify termination arguments: true
Simplify supporting invariants: trueOverapproximate stem: false
[2020-07-29 03:24:40,394 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,394 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2020-07-29 03:24:40,394 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,394 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,394 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,395 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2020-07-29 03:24:40,395 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2020-07-29 03:24:40,396 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 03:24:40,421 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 03:24:40,423 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,423 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2020-07-29 03:24:40,423 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,423 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,424 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,424 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2020-07-29 03:24:40,424 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2020-07-29 03:24:40,426 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 03:24:40,448 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 03:24:40,450 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,450 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,450 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,450 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,454 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2020-07-29 03:24:40,455 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2020-07-29 03:24:40,464 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 03:24:40,489 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 03:24:40,491 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,491 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,491 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,491 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,495 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2020-07-29 03:24:40,495 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2020-07-29 03:24:40,501 INFO  L522          LassoAnalysis]: Proving termination failed for this template and these settings.
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2020-07-29 03:24:40,524 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings:
Termination analysis: LINEAR_WITH_GUESSES
Number of strict supporting invariants: 0
Number of non-strict supporting invariants: 1
Consider only non-deceasing supporting invariants: true
Simplify termination arguments: true
Simplify supporting invariants: trueOverapproximate stem: false
Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2020-07-29 03:24:40,525 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2020-07-29 03:24:40,526 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2020-07-29 03:24:40,526 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2020-07-29 03:24:40,526 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2020-07-29 03:24:40,533 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2020-07-29 03:24:40,534 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2020-07-29 03:24:40,551 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2020-07-29 03:24:40,773 INFO  L443   ModelExtractionUtils]: Simplification made 10 calls to the SMT solver.
[2020-07-29 03:24:40,773 INFO  L444   ModelExtractionUtils]: 10 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero.
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 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 03:24:40,782 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2020-07-29 03:24:40,790 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2020-07-29 03:24:40,790 INFO  L510          LassoAnalysis]: Proved termination.
[2020-07-29 03:24:40,792 INFO  L512          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_max_~i~0, ~N~0) = -1*ULTIMATE.start_max_~i~0 + 1*~N~0
Supporting invariants []
[2020-07-29 03:24:40,845 INFO  L297   tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed
[2020-07-29 03:24:40,850 INFO  L393             LassoCheck]: Loop: "assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);" "assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2;" "max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3;" "max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0;" 
[2020-07-29 03:24:40,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-29 03:24:40,897 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-29 03:24:40,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-29 03:24:40,922 INFO  L263         TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core
[2020-07-29 03:24:40,931 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-29 03:24:40,931 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2020-07-29 03:24:40,947 INFO  L280        TraceCheckUtils]: 0: Hoare triple {40#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {40#unseeded} is VALID
[2020-07-29 03:24:40,950 INFO  L280        TraceCheckUtils]: 1: Hoare triple {40#unseeded} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {40#unseeded} is VALID
[2020-07-29 03:24:40,951 INFO  L280        TraceCheckUtils]: 2: Hoare triple {40#unseeded} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; {40#unseeded} is VALID
[2020-07-29 03:24:40,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-29 03:24:40,963 INFO  L263         TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core
[2020-07-29 03:24:40,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-29 03:24:40,969 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2020-07-29 03:24:40,995 INFO  L280        TraceCheckUtils]: 0: Hoare triple {43#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_max_~i~0) ~N~0))} assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {79#(and (< ULTIMATE.start_max_~i~0 ~N~0) (<= ~N~0 (+ oldRank0 ULTIMATE.start_max_~i~0)))} is VALID
[2020-07-29 03:24:40,996 INFO  L280        TraceCheckUtils]: 1: Hoare triple {79#(and (< ULTIMATE.start_max_~i~0 ~N~0) (<= ~N~0 (+ oldRank0 ULTIMATE.start_max_~i~0)))} assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; {79#(and (< ULTIMATE.start_max_~i~0 ~N~0) (<= ~N~0 (+ oldRank0 ULTIMATE.start_max_~i~0)))} is VALID
[2020-07-29 03:24:40,997 INFO  L280        TraceCheckUtils]: 2: Hoare triple {79#(and (< ULTIMATE.start_max_~i~0 ~N~0) (<= ~N~0 (+ oldRank0 ULTIMATE.start_max_~i~0)))} max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; {79#(and (< ULTIMATE.start_max_~i~0 ~N~0) (<= ~N~0 (+ oldRank0 ULTIMATE.start_max_~i~0)))} is VALID
[2020-07-29 03:24:41,001 INFO  L280        TraceCheckUtils]: 3: Hoare triple {79#(and (< ULTIMATE.start_max_~i~0 ~N~0) (<= ~N~0 (+ oldRank0 ULTIMATE.start_max_~i~0)))} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {68#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_max_~i~0) ~N~0)) (>= oldRank0 0)) unseeded)} is VALID
[2020-07-29 03:24:41,002 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 03:24:41,013 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states.
[2020-07-29 03:24:41,028 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-29 03:24:41,030 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 4 letters.
[2020-07-29 03:24:41,034 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,040 INFO  L152   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 
[2020-07-29 03:24:41,042 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states.
[2020-07-29 03:24:41,171 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 3 states. Result 63 states and 87 transitions. Complement of second has 8 states.
[2020-07-29 03:24:41,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 
[2020-07-29 03:24:41,173 INFO  L123   tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3
[2020-07-29 03:24:41,173 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states.
[2020-07-29 03:24:41,180 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 14
[2020-07-29 03:24:41,181 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2020-07-29 03:24:41,182 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2020-07-29 03:24:41,186 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states.
[2020-07-29 03:24:41,199 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 3
[2020-07-29 03:24:41,202 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2020-07-29 03:24:41,204 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2020-07-29 03:24:41,205 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 87 transitions.
[2020-07-29 03:24:41,207 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 10
[2020-07-29 03:24:41,207 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2020-07-29 03:24:41,208 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2020-07-29 03:24:41,210 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand 30 states.
[2020-07-29 03:24:41,213 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 14
[2020-07-29 03:24:41,218 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words.
[2020-07-29 03:24:41,219 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand 3 states.
[2020-07-29 03:24:41,222 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 3
[2020-07-29 03:24:41,223 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words.
[2020-07-29 03:24:41,223 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand 63 states and 87 transitions. cyclomatic complexity: 31
[2020-07-29 03:24:41,226 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words.
[2020-07-29 03:24:41,227 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 3 letters. Loop has 4 letters.
[2020-07-29 03:24:41,227 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,228 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 4 letters.
[2020-07-29 03:24:41,228 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,228 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 3 letters. Loop has 4 letters.
[2020-07-29 03:24:41,229 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,229 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 1 letters. Loop has 2 letters.
[2020-07-29 03:24:41,229 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,229 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters.
[2020-07-29 03:24:41,229 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,230 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters.
[2020-07-29 03:24:41,230 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,230 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 6 letters. Loop has 4 letters.
[2020-07-29 03:24:41,230 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,231 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters.
[2020-07-29 03:24:41,231 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,231 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 6 letters. Loop has 4 letters.
[2020-07-29 03:24:41,231 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,232 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 63 letters. Loop has 63 letters.
[2020-07-29 03:24:41,232 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,232 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 63 letters.
[2020-07-29 03:24:41,232 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,233 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 63 letters. Loop has 63 letters.
[2020-07-29 03:24:41,233 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,233 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 30 letters. Loop has 30 letters.
[2020-07-29 03:24:41,233 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,234 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 30 letters.
[2020-07-29 03:24:41,234 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,234 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 30 letters. Loop has 30 letters.
[2020-07-29 03:24:41,234 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,235 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 5 letters. Loop has 5 letters.
[2020-07-29 03:24:41,235 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,235 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters.
[2020-07-29 03:24:41,235 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,235 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 5 letters. Loop has 5 letters.
[2020-07-29 03:24:41,236 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,236 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 13 letters. Loop has 4 letters.
[2020-07-29 03:24:41,236 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,237 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 4 letters.
[2020-07-29 03:24:41,237 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,237 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 4 letters.
[2020-07-29 03:24:41,238 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,238 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 12 letters. Loop has 4 letters.
[2020-07-29 03:24:41,238 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,238 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters.
[2020-07-29 03:24:41,239 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,239 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 4 letters.
[2020-07-29 03:24:41,239 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,239 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 14 letters. Loop has 4 letters.
[2020-07-29 03:24:41,240 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,240 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 4 letters.
[2020-07-29 03:24:41,240 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,241 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 4 letters.
[2020-07-29 03:24:41,241 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,241 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 11 letters. Loop has 4 letters.
[2020-07-29 03:24:41,241 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,242 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters.
[2020-07-29 03:24:41,242 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,242 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 4 letters.
[2020-07-29 03:24:41,242 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,243 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 9 letters. Loop has 2 letters.
[2020-07-29 03:24:41,243 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,243 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters.
[2020-07-29 03:24:41,243 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,244 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 9 letters. Loop has 2 letters.
[2020-07-29 03:24:41,244 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,244 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 10 letters. Loop has 2 letters.
[2020-07-29 03:24:41,244 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,245 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters.
[2020-07-29 03:24:41,245 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,245 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 10 letters. Loop has 2 letters.
[2020-07-29 03:24:41,246 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,246 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 6 letters. Loop has 4 letters.
[2020-07-29 03:24:41,246 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,246 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters.
[2020-07-29 03:24:41,247 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,247 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 6 letters. Loop has 4 letters.
[2020-07-29 03:24:41,247 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,247 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 9 letters. Loop has 4 letters.
[2020-07-29 03:24:41,248 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,248 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters.
[2020-07-29 03:24:41,248 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,248 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 9 letters. Loop has 4 letters.
[2020-07-29 03:24:41,248 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,249 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 8 letters. Loop has 4 letters.
[2020-07-29 03:24:41,249 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,249 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters.
[2020-07-29 03:24:41,250 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,250 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 8 letters. Loop has 4 letters.
[2020-07-29 03:24:41,250 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,250 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 7 letters. Loop has 4 letters.
[2020-07-29 03:24:41,251 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,251 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters.
[2020-07-29 03:24:41,251 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,251 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 7 letters. Loop has 4 letters.
[2020-07-29 03:24:41,251 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,252 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 3 letters. Loop has 4 letters.
[2020-07-29 03:24:41,252 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,252 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 4 letters.
[2020-07-29 03:24:41,252 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,252 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 3 letters. Loop has 4 letters.
[2020-07-29 03:24:41,253 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,253 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 6 letters. Loop has 4 letters.
[2020-07-29 03:24:41,253 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,253 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters.
[2020-07-29 03:24:41,254 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,254 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 6 letters. Loop has 4 letters.
[2020-07-29 03:24:41,254 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,254 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 5 letters. Loop has 4 letters.
[2020-07-29 03:24:41,255 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,255 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters.
[2020-07-29 03:24:41,255 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,255 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 5 letters. Loop has 4 letters.
[2020-07-29 03:24:41,256 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,256 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 4 letters. Loop has 4 letters.
[2020-07-29 03:24:41,256 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,256 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters.
[2020-07-29 03:24:41,257 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,257 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 4 letters.
[2020-07-29 03:24:41,257 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,257 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 2 letters. Loop has 1 letters.
[2020-07-29 03:24:41,258 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,258 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters.
[2020-07-29 03:24:41,258 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,258 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 1 letters.
[2020-07-29 03:24:41,258 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,259 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 1 letters. Loop has 2 letters.
[2020-07-29 03:24:41,259 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,259 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters.
[2020-07-29 03:24:41,259 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,259 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters.
[2020-07-29 03:24:41,260 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,260 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 12 letters. Loop has 4 letters.
[2020-07-29 03:24:41,260 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,260 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters.
[2020-07-29 03:24:41,260 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,261 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 4 letters.
[2020-07-29 03:24:41,261 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,261 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 13 letters. Loop has 4 letters.
[2020-07-29 03:24:41,261 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,262 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 4 letters.
[2020-07-29 03:24:41,262 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,262 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 4 letters.
[2020-07-29 03:24:41,262 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,262 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 14 letters. Loop has 4 letters.
[2020-07-29 03:24:41,263 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,263 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 4 letters.
[2020-07-29 03:24:41,263 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,263 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 4 letters.
[2020-07-29 03:24:41,264 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,264 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 11 letters. Loop has 4 letters.
[2020-07-29 03:24:41,264 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,264 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters.
[2020-07-29 03:24:41,264 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,265 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 4 letters.
[2020-07-29 03:24:41,265 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,265 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 9 letters. Loop has 2 letters.
[2020-07-29 03:24:41,265 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,266 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters.
[2020-07-29 03:24:41,266 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,266 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 9 letters. Loop has 2 letters.
[2020-07-29 03:24:41,266 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,266 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 10 letters. Loop has 2 letters.
[2020-07-29 03:24:41,267 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,267 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters.
[2020-07-29 03:24:41,267 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,267 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 10 letters. Loop has 2 letters.
[2020-07-29 03:24:41,267 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,268 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 8 letters. Loop has 4 letters.
[2020-07-29 03:24:41,268 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,268 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters.
[2020-07-29 03:24:41,268 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,268 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 8 letters. Loop has 4 letters.
[2020-07-29 03:24:41,269 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,269 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 9 letters. Loop has 4 letters.
[2020-07-29 03:24:41,269 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,269 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters.
[2020-07-29 03:24:41,270 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,270 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 9 letters. Loop has 4 letters.
[2020-07-29 03:24:41,270 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,270 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 6 letters. Loop has 4 letters.
[2020-07-29 03:24:41,270 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,271 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters.
[2020-07-29 03:24:41,271 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,271 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 6 letters. Loop has 4 letters.
[2020-07-29 03:24:41,271 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,272 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 30 states. Stem has 7 letters. Loop has 4 letters.
[2020-07-29 03:24:41,272 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,272 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters.
[2020-07-29 03:24:41,272 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,272 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 63 states and 87 transitions. cyclomatic complexity: 31 Stem has 7 letters. Loop has 4 letters.
[2020-07-29 03:24:41,273 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,273 INFO  L161   tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3
[2020-07-29 03:24:41,275 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-07-29 03:24:41,277 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions.
[2020-07-29 03:24:41,277 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 4 letters.
[2020-07-29 03:24:41,277 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,278 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 7 letters. Loop has 4 letters.
[2020-07-29 03:24:41,278 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,278 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 8 letters.
[2020-07-29 03:24:41,278 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2020-07-29 03:24:41,279 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 87 transitions. cyclomatic complexity: 31
[2020-07-29 03:24:41,285 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 10
[2020-07-29 03:24:41,290 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 23 states and 32 transitions.
[2020-07-29 03:24:41,292 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 18
[2020-07-29 03:24:41,292 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 19
[2020-07-29 03:24:41,293 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions.
[2020-07-29 03:24:41,293 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-07-29 03:24:41,293 INFO  L688         BuchiCegarLoop]: Abstraction has 23 states and 32 transitions.
[2020-07-29 03:24:41,311 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions.
[2020-07-29 03:24:41,321 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2020-07-29 03:24:41,322 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-29 03:24:41,322 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 23 states and 32 transitions. Second operand 23 states.
[2020-07-29 03:24:41,323 INFO  L74              IsIncluded]: Start isIncluded. First operand 23 states and 32 transitions. Second operand 23 states.
[2020-07-29 03:24:41,326 INFO  L87              Difference]: Start difference. First operand 23 states and 32 transitions. Second operand 23 states.
[2020-07-29 03:24:41,331 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-29 03:24:41,331 INFO  L93              Difference]: Finished difference Result 23 states and 32 transitions.
[2020-07-29 03:24:41,332 INFO  L276                IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions.
[2020-07-29 03:24:41,333 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-29 03:24:41,333 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-29 03:24:41,333 INFO  L74              IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states and 32 transitions.
[2020-07-29 03:24:41,334 INFO  L87              Difference]: Start difference. First operand 23 states. Second operand 23 states and 32 transitions.
[2020-07-29 03:24:41,335 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-29 03:24:41,336 INFO  L93              Difference]: Finished difference Result 23 states and 32 transitions.
[2020-07-29 03:24:41,336 INFO  L276                IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions.
[2020-07-29 03:24:41,336 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-29 03:24:41,337 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-29 03:24:41,337 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-29 03:24:41,337 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-29 03:24:41,337 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2020-07-29 03:24:41,339 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions.
[2020-07-29 03:24:41,340 INFO  L711         BuchiCegarLoop]: Abstraction has 23 states and 32 transitions.
[2020-07-29 03:24:41,341 INFO  L591         BuchiCegarLoop]: Abstraction has 23 states and 32 transitions.
[2020-07-29 03:24:41,341 INFO  L424         BuchiCegarLoop]: ======== Iteration 2============
[2020-07-29 03:24:41,341 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions.
[2020-07-29 03:24:41,342 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 10
[2020-07-29 03:24:41,342 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2020-07-29 03:24:41,342 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2020-07-29 03:24:41,343 INFO  L849         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1]
[2020-07-29 03:24:41,343 INFO  L850         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2020-07-29 03:24:41,343 INFO  L794   eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 180#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 178#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 173#L11-3 assume !(max_~i~0 < ~N~0); 169#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 170#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 185#L11-8 
[2020-07-29 03:24:41,344 INFO  L796   eck$LassoCheckResult]: Loop: 185#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 177#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 167#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 168#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 185#L11-8 
[2020-07-29 03:24:41,344 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-29 03:24:41,344 INFO  L82        PathProgramCache]: Analyzing trace with hash 889511083, now seen corresponding path program 1 times
[2020-07-29 03:24:41,345 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-29 03:24:41,345 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31758950]
[2020-07-29 03:24:41,345 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-29 03:24:41,365 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-29 03:24:41,436 INFO  L280        TraceCheckUtils]: 0: Hoare triple {235#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {235#true} is VALID
[2020-07-29 03:24:41,436 INFO  L280        TraceCheckUtils]: 1: Hoare triple {235#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {235#true} is VALID
[2020-07-29 03:24:41,438 INFO  L280        TraceCheckUtils]: 2: Hoare triple {235#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; {237#(and (<= 2 ~N~0) (= ULTIMATE.start_max_~i~0 0))} is VALID
[2020-07-29 03:24:41,439 INFO  L280        TraceCheckUtils]: 3: Hoare triple {237#(and (<= 2 ~N~0) (= ULTIMATE.start_max_~i~0 0))} assume !(max_~i~0 < ~N~0); {236#false} is VALID
[2020-07-29 03:24:41,440 INFO  L280        TraceCheckUtils]: 4: Hoare triple {236#false} max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); {236#false} is VALID
[2020-07-29 03:24:41,440 INFO  L280        TraceCheckUtils]: 5: Hoare triple {236#false} main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; {236#false} is VALID
[2020-07-29 03:24:41,441 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 03:24:41,442 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31758950]
[2020-07-29 03:24:41,442 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-29 03:24:41,443 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-07-29 03:24:41,443 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688818728]
[2020-07-29 03:24:41,449 INFO  L799   eck$LassoCheckResult]: stem already infeasible
[2020-07-29 03:24:41,449 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-29 03:24:41,449 INFO  L82        PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 1 times
[2020-07-29 03:24:41,450 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-29 03:24:41,450 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952756565]
[2020-07-29 03:24:41,450 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-29 03:24:41,475 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-29 03:24:41,477 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-07-29 03:24:41,488 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-29 03:24:41,490 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-07-29 03:24:41,496 INFO  L174   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-07-29 03:24:41,568 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-29 03:24:41,570 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-07-29 03:24:41,571 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-07-29 03:24:41,572 INFO  L87              Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states.
[2020-07-29 03:24:41,678 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-29 03:24:41,678 INFO  L93              Difference]: Finished difference Result 26 states and 33 transitions.
[2020-07-29 03:24:41,678 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-07-29 03:24:41,679 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states.
[2020-07-29 03:24:41,689 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-29 03:24:41,690 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions.
[2020-07-29 03:24:41,697 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 10
[2020-07-29 03:24:41,699 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions.
[2020-07-29 03:24:41,699 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 19
[2020-07-29 03:24:41,699 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 19
[2020-07-29 03:24:41,699 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions.
[2020-07-29 03:24:41,699 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-07-29 03:24:41,699 INFO  L688         BuchiCegarLoop]: Abstraction has 26 states and 33 transitions.
[2020-07-29 03:24:41,700 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions.
[2020-07-29 03:24:41,704 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23.
[2020-07-29 03:24:41,704 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-29 03:24:41,705 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 26 states and 33 transitions. Second operand 23 states.
[2020-07-29 03:24:41,705 INFO  L74              IsIncluded]: Start isIncluded. First operand 26 states and 33 transitions. Second operand 23 states.
[2020-07-29 03:24:41,705 INFO  L87              Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 23 states.
[2020-07-29 03:24:41,707 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-29 03:24:41,707 INFO  L93              Difference]: Finished difference Result 26 states and 33 transitions.
[2020-07-29 03:24:41,708 INFO  L276                IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions.
[2020-07-29 03:24:41,708 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-29 03:24:41,708 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-29 03:24:41,708 INFO  L74              IsIncluded]: Start isIncluded. First operand 23 states. Second operand 26 states and 33 transitions.
[2020-07-29 03:24:41,709 INFO  L87              Difference]: Start difference. First operand 23 states. Second operand 26 states and 33 transitions.
[2020-07-29 03:24:41,710 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-29 03:24:41,711 INFO  L93              Difference]: Finished difference Result 26 states and 33 transitions.
[2020-07-29 03:24:41,711 INFO  L276                IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions.
[2020-07-29 03:24:41,711 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-29 03:24:41,711 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-29 03:24:41,712 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-29 03:24:41,712 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-29 03:24:41,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2020-07-29 03:24:41,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions.
[2020-07-29 03:24:41,713 INFO  L711         BuchiCegarLoop]: Abstraction has 23 states and 29 transitions.
[2020-07-29 03:24:41,714 INFO  L591         BuchiCegarLoop]: Abstraction has 23 states and 29 transitions.
[2020-07-29 03:24:41,714 INFO  L424         BuchiCegarLoop]: ======== Iteration 3============
[2020-07-29 03:24:41,714 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions.
[2020-07-29 03:24:41,715 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 10
[2020-07-29 03:24:41,715 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2020-07-29 03:24:41,715 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2020-07-29 03:24:41,715 INFO  L849         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-29 03:24:41,716 INFO  L850         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2020-07-29 03:24:41,716 INFO  L794   eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 283#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 281#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 276#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 277#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 284#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 279#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 278#L11-3 assume !(max_~i~0 < ~N~0); 272#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 273#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 288#L11-8 
[2020-07-29 03:24:41,716 INFO  L796   eck$LassoCheckResult]: Loop: 288#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 280#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 270#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 271#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 288#L11-8 
[2020-07-29 03:24:41,716 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-29 03:24:41,717 INFO  L82        PathProgramCache]: Analyzing trace with hash -1805667996, now seen corresponding path program 1 times
[2020-07-29 03:24:41,717 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-29 03:24:41,717 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131411779]
[2020-07-29 03:24:41,717 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-29 03:24:41,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-29 03:24:41,783 INFO  L280        TraceCheckUtils]: 0: Hoare triple {344#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {344#true} is VALID
[2020-07-29 03:24:41,783 INFO  L280        TraceCheckUtils]: 1: Hoare triple {344#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {344#true} is VALID
[2020-07-29 03:24:41,785 INFO  L280        TraceCheckUtils]: 2: Hoare triple {344#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; {346#(and (<= 2 ~N~0) (= ULTIMATE.start_max_~i~0 0))} is VALID
[2020-07-29 03:24:41,786 INFO  L280        TraceCheckUtils]: 3: Hoare triple {346#(and (<= 2 ~N~0) (= ULTIMATE.start_max_~i~0 0))} assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {346#(and (<= 2 ~N~0) (= ULTIMATE.start_max_~i~0 0))} is VALID
[2020-07-29 03:24:41,787 INFO  L280        TraceCheckUtils]: 4: Hoare triple {346#(and (<= 2 ~N~0) (= ULTIMATE.start_max_~i~0 0))} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {346#(and (<= 2 ~N~0) (= ULTIMATE.start_max_~i~0 0))} is VALID
[2020-07-29 03:24:41,788 INFO  L280        TraceCheckUtils]: 5: Hoare triple {346#(and (<= 2 ~N~0) (= ULTIMATE.start_max_~i~0 0))} max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; {346#(and (<= 2 ~N~0) (= ULTIMATE.start_max_~i~0 0))} is VALID
[2020-07-29 03:24:41,789 INFO  L280        TraceCheckUtils]: 6: Hoare triple {346#(and (<= 2 ~N~0) (= ULTIMATE.start_max_~i~0 0))} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {347#(<= (+ ULTIMATE.start_max_~i~0 1) ~N~0)} is VALID
[2020-07-29 03:24:41,791 INFO  L280        TraceCheckUtils]: 7: Hoare triple {347#(<= (+ ULTIMATE.start_max_~i~0 1) ~N~0)} assume !(max_~i~0 < ~N~0); {345#false} is VALID
[2020-07-29 03:24:41,791 INFO  L280        TraceCheckUtils]: 8: Hoare triple {345#false} max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); {345#false} is VALID
[2020-07-29 03:24:41,791 INFO  L280        TraceCheckUtils]: 9: Hoare triple {345#false} main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; {345#false} is VALID
[2020-07-29 03:24:41,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-29 03:24:41,792 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131411779]
[2020-07-29 03:24:41,792 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500082293]
[2020-07-29 03:24:41,792 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-29 03:24:41,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-29 03:24:41,840 INFO  L263         TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core
[2020-07-29 03:24:41,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-29 03:24:41,849 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2020-07-29 03:24:41,972 INFO  L280        TraceCheckUtils]: 0: Hoare triple {344#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {344#true} is VALID
[2020-07-29 03:24:41,972 INFO  L280        TraceCheckUtils]: 1: Hoare triple {344#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {344#true} is VALID
[2020-07-29 03:24:41,974 INFO  L280        TraceCheckUtils]: 2: Hoare triple {344#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; {357#(and (<= ULTIMATE.start_max_~i~0 0) (< 1 ~N~0))} is VALID
[2020-07-29 03:24:41,975 INFO  L280        TraceCheckUtils]: 3: Hoare triple {357#(and (<= ULTIMATE.start_max_~i~0 0) (< 1 ~N~0))} assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {357#(and (<= ULTIMATE.start_max_~i~0 0) (< 1 ~N~0))} is VALID
[2020-07-29 03:24:41,976 INFO  L280        TraceCheckUtils]: 4: Hoare triple {357#(and (<= ULTIMATE.start_max_~i~0 0) (< 1 ~N~0))} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {357#(and (<= ULTIMATE.start_max_~i~0 0) (< 1 ~N~0))} is VALID
[2020-07-29 03:24:41,976 INFO  L280        TraceCheckUtils]: 5: Hoare triple {357#(and (<= ULTIMATE.start_max_~i~0 0) (< 1 ~N~0))} max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; {357#(and (<= ULTIMATE.start_max_~i~0 0) (< 1 ~N~0))} is VALID
[2020-07-29 03:24:41,977 INFO  L280        TraceCheckUtils]: 6: Hoare triple {357#(and (<= ULTIMATE.start_max_~i~0 0) (< 1 ~N~0))} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {370#(and (<= ULTIMATE.start_max_~i~0 1) (< 1 ~N~0))} is VALID
[2020-07-29 03:24:41,978 INFO  L280        TraceCheckUtils]: 7: Hoare triple {370#(and (<= ULTIMATE.start_max_~i~0 1) (< 1 ~N~0))} assume !(max_~i~0 < ~N~0); {345#false} is VALID
[2020-07-29 03:24:41,979 INFO  L280        TraceCheckUtils]: 8: Hoare triple {345#false} max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); {345#false} is VALID
[2020-07-29 03:24:41,979 INFO  L280        TraceCheckUtils]: 9: Hoare triple {345#false} main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; {345#false} is VALID
[2020-07-29 03:24:41,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-29 03:24:41,980 INFO  L220   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-07-29 03:24:41,980 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6
[2020-07-29 03:24:41,980 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311217412]
[2020-07-29 03:24:41,981 INFO  L799   eck$LassoCheckResult]: stem already infeasible
[2020-07-29 03:24:41,981 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-29 03:24:41,981 INFO  L82        PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 2 times
[2020-07-29 03:24:41,981 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-29 03:24:41,981 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679094684]
[2020-07-29 03:24:41,982 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-29 03:24:41,996 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-29 03:24:41,997 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-07-29 03:24:42,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-29 03:24:42,011 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-07-29 03:24:42,016 INFO  L174   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-07-29 03:24:42,099 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-29 03:24:42,100 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-07-29 03:24:42,100 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2020-07-29 03:24:42,100 INFO  L87              Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states.
[2020-07-29 03:24:42,269 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-29 03:24:42,269 INFO  L93              Difference]: Finished difference Result 30 states and 38 transitions.
[2020-07-29 03:24:42,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-07-29 03:24:42,270 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states.
[2020-07-29 03:24:42,292 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-29 03:24:42,293 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions.
[2020-07-29 03:24:42,295 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 10
[2020-07-29 03:24:42,303 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions.
[2020-07-29 03:24:42,303 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 19
[2020-07-29 03:24:42,303 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 19
[2020-07-29 03:24:42,303 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions.
[2020-07-29 03:24:42,304 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-07-29 03:24:42,304 INFO  L688         BuchiCegarLoop]: Abstraction has 30 states and 38 transitions.
[2020-07-29 03:24:42,304 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions.
[2020-07-29 03:24:42,307 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27.
[2020-07-29 03:24:42,308 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-29 03:24:42,308 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 30 states and 38 transitions. Second operand 27 states.
[2020-07-29 03:24:42,308 INFO  L74              IsIncluded]: Start isIncluded. First operand 30 states and 38 transitions. Second operand 27 states.
[2020-07-29 03:24:42,308 INFO  L87              Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 27 states.
[2020-07-29 03:24:42,310 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-29 03:24:42,311 INFO  L93              Difference]: Finished difference Result 30 states and 38 transitions.
[2020-07-29 03:24:42,311 INFO  L276                IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions.
[2020-07-29 03:24:42,311 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-29 03:24:42,311 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-29 03:24:42,311 INFO  L74              IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states and 38 transitions.
[2020-07-29 03:24:42,311 INFO  L87              Difference]: Start difference. First operand 27 states. Second operand 30 states and 38 transitions.
[2020-07-29 03:24:42,313 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-29 03:24:42,313 INFO  L93              Difference]: Finished difference Result 30 states and 38 transitions.
[2020-07-29 03:24:42,314 INFO  L276                IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions.
[2020-07-29 03:24:42,314 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-29 03:24:42,314 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-29 03:24:42,315 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-29 03:24:42,315 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-29 03:24:42,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 27 states.
[2020-07-29 03:24:42,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions.
[2020-07-29 03:24:42,316 INFO  L711         BuchiCegarLoop]: Abstraction has 27 states and 34 transitions.
[2020-07-29 03:24:42,316 INFO  L591         BuchiCegarLoop]: Abstraction has 27 states and 34 transitions.
[2020-07-29 03:24:42,316 INFO  L424         BuchiCegarLoop]: ======== Iteration 4============
[2020-07-29 03:24:42,316 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions.
[2020-07-29 03:24:42,321 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 10
[2020-07-29 03:24:42,321 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2020-07-29 03:24:42,321 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2020-07-29 03:24:42,323 INFO  L849         BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2020-07-29 03:24:42,323 INFO  L850         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2020-07-29 03:24:42,323 INFO  L794   eck$LassoCheckResult]: Stem: 430#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 427#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 425#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 419#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 420#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 435#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 423#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 421#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 422#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 428#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 429#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 434#L11-3 assume !(max_~i~0 < ~N~0); 413#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 414#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 433#L11-8 
[2020-07-29 03:24:42,324 INFO  L796   eck$LassoCheckResult]: Loop: 433#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 424#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 415#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 416#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 433#L11-8 
[2020-07-29 03:24:42,324 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-29 03:24:42,324 INFO  L82        PathProgramCache]: Analyzing trace with hash 1818198429, now seen corresponding path program 2 times
[2020-07-29 03:24:42,325 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-29 03:24:42,325 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286748874]
[2020-07-29 03:24:42,325 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-29 03:24:42,387 FATAL L?                        ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception:
java.lang.AssertionError
	at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.<init>(TableauxRow.java:45)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494)
	at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446)
	at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163)
	at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:295)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.<init>(TraceCheck.java:206)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.<init>(InterpolatingTraceCheck.java:90)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.<init>(InterpolatingTraceCheckCraig.java:89)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.<init>(AutomatonFreeRefinementEngine.java:85)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(TraceAbstractionRefinementEngine.java:75)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:883)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.<init>(LassoCheck.java:797)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.<init>(LassoCheck.java:251)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458)
	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 03:24:42,397 INFO  L168              Benchmark]: Toolchain (without parser) took 5471.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 960.2 MB in the beginning and 953.9 MB in the end (delta: 6.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB.
[2020-07-29 03:24:42,398 INFO  L168              Benchmark]: CDTParser took 0.33 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 03:24:42,399 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 289.71 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
[2020-07-29 03:24:42,402 INFO  L168              Benchmark]: Boogie Procedure Inliner took 118.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 949.4 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB.
[2020-07-29 03:24:42,403 INFO  L168              Benchmark]: Boogie Preprocessor took 38.91 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 03:24:42,403 INFO  L168              Benchmark]: RCFGBuilder took 630.29 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: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB.
[2020-07-29 03:24:42,408 INFO  L168              Benchmark]: BuchiAutomizer took 4386.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 953.9 MB in the end (delta: 125.2 MB). Peak memory consumption was 197.0 MB. Max. memory is 11.5 GB.
[2020-07-29 03:24:42,412 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.33 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 289.71 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
 * Boogie Procedure Inliner took 118.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 949.4 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB.
 * Boogie Preprocessor took 38.91 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 630.29 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: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB.
 * BuchiAutomizer took 4386.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 953.9 MB in the end (delta: 125.2 MB). Peak memory consumption was 197.0 MB. Max. memory is 11.5 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer:
  - ExceptionOrErrorResult: AssertionError: null
    de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.<init>(TableauxRow.java:45)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
Received shutdown request...